Rooted Hypersequent Calculus for Modal Logic S5

&
Logica Universalis 17 (3):269-295 (2023)
  Copy   BIBTEX

Abstract

We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are established as well.

Categories

Keywords

Reprint years

DOI

10.1007/s11787-023-00328-w

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,445

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

From Single Agent to Multi-Agent via Hypersequents.Francesca Poggiolesi - 2013 - Logica Universalis 7 (2):147-166.
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.
A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
Labeled sequent calculus for justification logics.Meghdad Ghari - 2017 - Annals of Pure and Applied Logic 168 (1):72-111.
Intermediate Logics Admitting a Structural Hypersequent Calculus.Frederik M. Lauridsen - 2019 - Studia Logica 107 (2):247-282.
Common knowledge: finite calculus with syntactic cut-elimination procedure.Francesca Poggiolesi & Brian Hill - 2015 - Logique Et Analyse 58 (230):279-306.
Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D.Samara Burns & Richard Zach - 2021 - Review of Symbolic Logic 14 (4):910-929.
Hypersequent Calculi for Modal Logics.Samara Elizabeth Burns - unknown
A Contraction-free and Cut-free Sequent Calculus for Propositional Dynamic Logic.Brian Hill & Francesca Poggiolesi - 2010 - Studia Logica 94 (1):47-72.
A reduction-based cut-free Gentzen calculus for dynamic epistemic logic1.Martin Wirsing & Alexander Knapp - 2023 - Logic Journal of the IGPL 31 (6):1047-1068.

Analytics

Added to PP
2023-06-22

Downloads
30 (#624,626)

6 months
11 (#245,984)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.
Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.
Deep sequent systems for modal logic.Kai Brünnler - 2009 - Archive for Mathematical Logic 48 (6):551-577.

View all 13 references / Add more references