Proof analysis in modal logic

Journal of Philosophical Logic 34 (5/6):507 - 544 (2005)
Abstract
A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel-Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems
Keywords No keywords specified (fix it)
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: 12,127
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

No references found.

Citations of this work BETA
Melvin Fitting (2012). Prefixed Tableaus and Nested Sequents. Annals of Pure and Applied Logic 163 (3):291 - 313.
Sara Negri (2011). Proof Theory for Modal Logic. Philosophy Compass 6 (8):523-538.

View all 6 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

24 ( #77,140 of 1,102,455 )

Recent downloads (6 months)

6 ( #50,680 of 1,102,455 )

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.