Journal of Symbolic Logic 68 (4):1403-1414 (2003)
|Abstract||It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg  proved this fact in a syntactic way. Mints  extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints' result to the basic modal logic S4; we investigate the correspondence between the quantified versions of S4 (with and without the Barcan formula) and the classical predicate logic (with one-sorted variable). We present a purely proof-theoretic proof-transformation method, reducing an LK-proof of an interpreted formula to a modal proof|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Patrick Blackburn (2001). Modal Logic as Dialogical Logic. Synthese 127 (1-2):57 - 93.
Giovanna Corsi (2002). A Unified Completeness Theorem for Quantified Modal Logics. Journal of Symbolic Logic 67 (4):1483-1510.
Rani Nelken & Chung-Chieh Shan (2006). A Modal Interpretation of the Logic of Interrogation. Journal of Logic, Language and Information 15 (3).
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
George Boolos (1979). The Unprovability of Consistency: An Essay in Modal Logic. Cambridge University Press.
Pavel Hrubeš (2007). Lower Bounds for Modal Logics. Journal of Symbolic Logic 72 (3):941-958.
Heinrich Wansing (1999). Predicate Logics on Display. Studia Logica 62 (1):49-75.
H. Kushida & M. Okada (2007). A Proof–Theoretic Study of the Correspondence of Hybrid Logic and Classical Logic. Journal of Logic, Language and Information 16 (1).
Added to index2009-01-28
Total downloads4 ( #178,675 of 549,087 )
Recent downloads (6 months)1 ( #63,317 of 549,087 )
How can I increase my downloads?