Prefixed tableaus and nested sequents

Annals of Pure and Applied Logic 163 (3):291 - 313 (2012)
  Copy   BIBTEX

Abstract

Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants of each other, roughly in the same way that tableaus and Gentzen sequent calculi are notational variants. This immediately gives rise to new modal nested sequent systems which may be of independent interest. We discuss some of these, including those for some justification logics that include standard modal operators.

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Modal sequents and definability.Bruce M. Kapron - 1987 - Journal of Symbolic Logic 52 (3):756-762.
Tableaus for many-valued modal logic.Melvin Fitting - 1995 - Studia Logica 55 (1):63 - 87.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
Sequent-systems for modal logic.Kosta Došen - 1985 - Journal of Symbolic Logic 50 (1):149-168.
Refutation systems in modal logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
Indexed systems of sequents and cut-elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
Actualism and higher-order worlds.Reina Hayaki - 2003 - Philosophical Studies 115 (2):149 - 178.
Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.

Analytics

Added to PP
2011-02-09

Downloads
91 (#181,673)

6 months
10 (#219,185)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Melvin Fitting
CUNY Graduate Center

Citations of this work

Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
Nested Sequents for Intuitionistic Logics.Melvin Fitting - 2014 - Notre Dame Journal of Formal Logic 55 (1):41-61.
Reflecting on Social Influence in Networks.Zoé Christoff, Jens Ulrik Hansen & Carlo Proietti - 2014 - Journal of Logic, Language and Information 25 (3-4):299-333.

View all 18 citations / Add more citations

References found in this work

Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
The logic of proofs, semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.
Justification logic.Sergei Artemov - forthcoming - Stanford Encyclopedia of Philosophy.
Deep sequent systems for modal logic.Kai Brünnler - 2009 - Archive for Mathematical Logic 48 (6):551-577.

View all 10 references / Add more references