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)
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
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,825
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
Wolfgang Rautenberg (1983). Modal Tableau Calculi and Interpolation. Journal of Philosophical Logic 12 (4):403 - 423.

View all 9 references

Citations of this work BETA
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

7 ( #192,693 of 1,100,036 )

Recent downloads (6 months)

1 ( #304,128 of 1,100,036 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.