1 results
REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 27 / Issue 1 / March 2021
- Published online by Cambridge University Press:
- 06 May 2021, pp. 39-66
- Print publication:
- March 2021
-
- Article
- Export citation
-
Satisfaction systems and reductions between them are presented as an appropriate context for analyzing the satisfiability and the validity problems. The notion of reduction is generalized in order to cope with the meet-combination of logics. Reductions between satisfaction systems induce reductions between the respective satisfiability problems and (under mild conditions) also between their validity problems. Sufficient conditions are provided for relating satisfiability problems to validity problems. Reflection results for decidability in the presence of reductions are established. The validity problem in the meet-combination is proved to be decidable whenever the validity problem for the components are decidable. Several examples are discussed, namely, involving modal and intuitionistic logics, as well as the meet-combination of
$\textrm {K}$
modal logic and intuitionistic logic.
