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)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,204
Through your library
References found in this work BETA
First-Order Logic.Raymond M. Smullyan - 1968 - New York [Etc.]Springer-Verlag.
Socratic Proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.
Modal Tableau Calculi and Interpolation.Wolfgang Rautenberg - 1983 - Journal of Philosophical Logic 12 (4):403 - 423.

View all 7 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

14 ( #331,287 of 2,164,286 )

Recent downloads (6 months)

1 ( #348,039 of 2,164,286 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums