Bulletin of Symbolic Logic 27 (1):39-66 (2021)
| Authors |
|
| Abstract |
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 modal logic and intuitionistic logic.
|
| Keywords | meet-combination of logics reduction decidability |
| Categories | (categorize this paper) |
| DOI | 10.1017/bsl.2021.17 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Grundzüge der theoretischen Logik.D. Hilbert & W. Ackermann - 1928 - Annalen der Philosophie Und Philosophischen Kritik 7:157-157.
Modal Logic.Yde Venema, Alexander Chagrov & Michael Zakharyaschev - 2000 - Philosophical Review 109 (2):286.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
On Languages with Two Variables.Michael Mortimer - 1975 - Mathematical Logic Quarterly 21 (1):135-140.
Axioms for Abstract Model Theory.K. Jon Barwise - 1974 - Annals of Mathematical Logic 7 (2-3):221-265.
View all 20 references / Add more references
Citations of this work BETA
No citations found.
Similar books and articles
The Unrestricted Combination of Temporal Logic Systems.Marcelo Finger & M. Weiss - 2002 - Logic Journal of the IGPL 10 (2):165-189.
Probabilization of Logics: Completeness and Decidability. [REVIEW]Pedro Baltazar - 2013 - Logica Universalis 7 (4):403-440.
Completeness and Decidability of Tense Logics Closely Related to Logics Above K4.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
Decidability for Some Justification Logics with Negative Introspection.Thomas Studer - 2013 - Journal of Symbolic Logic 78 (2):388-402.
Modulated Fibring and the Collapsing Problem.Cristina Sernadas, João Rasga & Walter A. Carnielli - 2002 - Journal of Symbolic Logic 67 (4):1541-1569.
Completeness and Decidability of Tense Logics Closely Related to Logics Above K.Frank Wolter - 1997 - Journal of Symbolic Logic 62 (1):131-158.
A General Method for Proving Decidability of Intuitionistic Modal Logics.Natasha Alechina & Dmitry Shkatov - 2006 - Journal of Applied Logic 4 (3):219-230.
Importing Logics.João Rasga, Amílcar Sernadas & Cristina Sernadas - 2012 - Studia Logica 100 (3):545-581.
On Graph-Theoretic Fibring of Logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
Tense Logic Without Tense Operators.Frank Wolter - 1996 - Mathematical Logic Quarterly 42 (1):145-171.
Theories of Ω-Layered Metric Temporal Structures: Expressiveness and Decidability.A. Montanari, A. Peron & A. Policriti - 1999 - Logic Journal of the IGPL 7 (1):79-102.
More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
A Graph-Theoretic Account of Logics.A. Sernadas, C. Sernadas, J. Rasga & Marcelo E. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1281-1320.
Preservation of Admissible Rules When Combining Logics.João Rasga, Cristina Sernadas & Amílcar Sernadas - 2016 - Review of Symbolic Logic 9 (4):641-663.
Analytics
Added to PP index
2021-05-07
Total views
4 ( #1,282,842 of 2,519,659 )
Recent downloads (6 months)
1 ( #406,756 of 2,519,659 )
2021-05-07
Total views
4 ( #1,282,842 of 2,519,659 )
Recent downloads (6 months)
1 ( #406,756 of 2,519,659 )
How can I increase my downloads?
Downloads
