Bulletin of Symbolic Logic 27 (1):39-66 (2021)

Authors
Walter Carnielli
University of Campinas
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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,379
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

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.

Add more citations

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.
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.
More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
Combinator Logics.Lou Goble - 2004 - Studia Logica 76 (1):17 - 66.
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.

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 )

How can I increase my downloads?

Downloads

My notes