On the proof-theory of two formalisations of modal first-order logic

Studia Logica 96 (3):349-373 (2010)
Abstract
We introduce a Gentzen-style modal predicate logic and prove the cut-elimination theorem for it. This sequent calculus of cut-free proofs is chosen as a proxy to develop the proof-theory of the logics introduced in [14, 15, 4]. We present syntactic proofs for all the metatheoretical results that were proved model-theoretically in loc. cit. and moreover prove that the form of weak reflection proved in these papers is as strong as possible
Keywords Gentzen-style logic  Hilbert-style logic  modal first-order logic  sequent calculus  cut-elimination  reflection theorem
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

View all 7 references

Citations of this work BETA

No citations found.

Similar books and articles
Sara Negri (2005). Proof Analysis in Modal Logic. Journal of Philosophical Logic 34 (5/6):507 - 544.
Grigori Mints (1997). Indexed Systems of Sequents and Cut-Elimination. Journal of Philosophical Logic 26 (6):671-696.
Analytics

Monthly downloads

Added to index

2010-12-08

Total downloads

19 ( #92,858 of 1,100,077 )

Recent downloads (6 months)

4 ( #90,379 of 1,100,077 )

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.