A loop-free decision procedure for modal propositional logics k4, s4 and S

Journal of Philosophical Logic 38 (2):151 - 177 (2009)
Abstract
The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic proofs for modal logics, which is grounded in the logic of questions IEL.
Keywords logic of questions  loop-free procedures  the method of Socratic proofs  transitive modal logics
Categories (categorize this paper)
DOI 10.1007/s10992-008-9089-z
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,803
Through your library
References found in this work BETA
First-Order Logic.Raymond M. Smullyan - 1968 - New York [Etc.]Springer-Verlag.
Structural Proof Theory.Sara Negri, Jan von Plato & Aarne Ranta - 2001 - Cambridge University Press.
Socratic Proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.

View all 11 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
16 ( #308,603 of 2,202,720 )

Recent downloads (6 months)
2 ( #149,904 of 2,202,720 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature