Comparing modal sequent systems

Abstract

This is an exploratory and expository paper, comparing display logic formulations of normal modal logics with labelled sequent systems. We provide a translation from display sequents into labelled sequents. The comparison between different systems gives us a different way to understand the difference between display systems and other sequent calculi as a difference between local and global views of consequence. The mapping between display and labelled systems also gives us a way to understand labelled systems as properly structural and not just as systems encoding modal logic into first-order logic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

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

Through your library

  • Only published works are available at libraries.

Similar books and articles

Modal translations in substructural logics.Kosta Došen - 1992 - Journal of Philosophical Logic 21 (3):283 - 336.
Prefixed tableaus and nested sequents.Melvin Fitting - 2012 - Annals of Pure and Applied Logic 163 (3):291 - 313.
Indexed systems of sequents and cut-elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
Sequent-systems and groupoid models. I.Kosta Došen - 1988 - Studia Logica 47 (4):353 - 385.
Predicate logics on display.Heinrich Wansing - 1999 - Studia Logica 62 (1):49-75.
Sequent-systems and groupoid models. II.Kosta Došen - 1989 - Studia Logica 48 (1):41 - 65.
Modal logic as metalogic.Kosta Došen - 1992 - Journal of Logic, Language and Information 1 (3):173-201.
Modal sequents and definability.Bruce M. Kapron - 1987 - Journal of Symbolic Logic 52 (3):756-762.

Analytics

Added to PP
2009-01-28

Downloads
63 (#255,614)

6 months
2 (#1,188,460)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Greg Restall
University of Melbourne

Citations of this work

Proof Theory for Modal Logic.Sara Negri - 2011 - Philosophy Compass 6 (8):523-538.
From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2018 - In Anil Nerode & Sergei Artemov (eds.), Logical Foundations of Computer Science. Springer International Publishing. pp. 120 - 139.
Labelled Tree Sequents, Tree Hypersequents and Nested Sequents.Rajeev Goré & Revantha Ramanayake - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 279-299.

Add more citations

References found in this work

Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005. Cambridge: Cambridge University Press. pp. 151-172.
Power and weakness of the modal display calculus.Marcus Kracht - 1996 - In Heinrich Wansing (ed.), Proof theory of modal logic. Boston: Kluwer Academic Publishers. pp. 93--121.

Add more references