Review of Symbolic Logic 1 (1):3-15 (2008)

Francesca Poggiolesi
Centre National de la Recherche Scientifique
In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s1755020308080040
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,066
Through your library

References found in this work BETA

Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
Sequent-Systems for Modal Logic.Kosta Došen - 1985 - Journal of Symbolic Logic 50 (1):149-168.
Indexed Systems of Sequents and Cut-Elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
A Cut-Free Gentzen Formulation Of The Modal Logic S5.T. Braüner - 2000 - Logic Journal of the IGPL 8 (5):629-643.

View all 7 references / Add more references

Citations of this work BETA

Shifting Priorities: Simple Representations for Twenty-Seven Iterated Theory Change Operators.Hans Rott - 2006 - In David Makinson, Jacek Malinowski & Heinrich Wansing (eds.), Towards Mathematical Philosophy. Dordrecht: Springer. pp. 269–296.
Truth Values and Proof Theory.Greg Restall - 2009 - Studia Logica 92 (2):241-264.

View all 17 citations / Add more citations

Similar books and articles


Added to PP index

Total views
36 ( #313,571 of 2,498,779 )

Recent downloads (6 months)
1 ( #422,193 of 2,498,779 )

How can I increase my downloads?


My notes