A modal sequent calculus for a fragment of arithmetic

Studia Logica 39 (2-3):245 - 256 (1980)
Global properties of canonical derivability predicates (the standard example is Pr() in Peano Arithmetic) are studied here by means of a suitable propositional modal logic GL. A whole book [1] has appeared on GL and we refer to it for more information and a bibliography on GL. Here we propose a sequent calculus for GL and, by exhibiting a good proof procedure, prove that such calculus admits the elimination of cuts. Most of standard results on GL are then easy consequences: completeness, decidability, finite model property, interpolation and the fixed point theorem.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370323
 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: 16,667
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.

Add more references

Citations of this work BETA
Sara Negri (2011). Proof Theory for Modal Logic. Philosophy Compass 6 (8):523-538.
Wolfgang Rautenberg (1983). Modal Tableau Calculi and Interpolation. Journal of Philosophical Logic 12 (4):403 - 423.

View all 9 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

9 ( #254,415 of 1,726,249 )

Recent downloads (6 months)

5 ( #147,227 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

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