Review of Symbolic Logic 1 (1):3-15 (2008)
| Authors |
|
| Abstract |
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 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Indexed Systems of Sequents and Cut-Elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
Generalised Sequent Calculus for Propositional Modal Logics.Andrzej Indrzejczak - 1997 - Logica Trianguli 1:15-31.
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.
Non-Classical Elegance for Sequent Calculus Enthusiasts.Andreas Fjellstad - 2017 - Studia Logica 105 (1):93-119.
On Deriving Nested Calculi for Intuitionistic Logics From Semantic Systems.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 177-194.
Hypersequent Calculi for S5: The Methods of Cut Elimination.Kaja Bednarska & Andrzej Indrzejczak - 2015 - Logic and Logical Philosophy 24 (3):277–311.
View all 17 citations / Add more citations
Similar books and articles
A Simple Proof of Completeness and Cut-Elimination for Propositional G¨ Odel Logic.Arnon Avron - unknown
A Purely Syntactic and Cut-Free Sequent Calculus for the Modal Logic of Provability.Francesca Poggiolesi - 2009 - Review of Symbolic Logic 2 (4):593-611.
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic.Roy Dyckhoff & Luis Pinto - 1998 - Studia Logica 60 (1):107-118.
Cut-Elimination and Proof-Search for Bi-Intuitionistic Logic Using Nested Sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 2008 - In Carlos Areces & Robert Goldblatt (eds.), Advances in Modal Logic, Volume 7. CSLI Publications. pp. 43-66.
Combining Derivations and Refutations for Cut-Free Completeness in Bi-Intuitionistic Logic.Linda Postniece - unknown
Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.
Analytics
Added to PP index
2009-01-28
Total views
36 ( #313,571 of 2,498,779 )
Recent downloads (6 months)
1 ( #422,193 of 2,498,779 )
2009-01-28
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?
Downloads
