A focused framework for emulating modal proof systems

Several deductive formalisms (e.g., sequent, nested sequent, labeled sequent, hyperse-quent calculi) have been used in the literature for the treatment of modal logics, and some connections between these formalisms are already known. Here we propose a general framework, which is based on a focused version of the labeled sequent calculus by Negri, augmented with some parametric devices allowing to restrict the set of proofs. By properly defining such restrictions and by choosing an appropriate polarization of formulas, one can obtain different, concrete proof systems for the modal logic K and for its extensions by means of geometric axioms. In particular, we show how to use the expressiveness of the labeled approach and the control mechanisms of focusing in order to emulate in our framework the behavior of a range of existing formalisms and proof systems for modal logic.

[1]  Dale Miller,et al.  Canonical Sequent Proofs via Multi-Focusing , 2008, IFIP TCS.

[2]  Rajeev Goré,et al.  Tableau Methods for Modal and Temporal Logics , 1999 .

[3]  Charles A. Stewart,et al.  A Systematic Proof Theory for Several Modal Logics , 2004, Advances in Modal Logic.

[4]  Kai Brünnler,et al.  Deep sequent systems for modal logic , 2009, Arch. Math. Log..

[5]  A. Avron.  The method of hypersequents in the proof theory of propositional non-classical logics , 1996 .

[6]  Henrik Sahlqvist.  Completeness and Correspondence in the First and Second Order Semantics for Modal Logic , 1975 .

[7]  Stephen Read,et al.  SEMANTIC POLLUTION AND SYNTACTIC PURITY , 2015, The Review of Symbolic Logic.

[8]  Dov M. Gabbay,et al.  Chapter 13 – Labelled Deductive Systems , 2003 .

[9]  Dale Miller,et al.  A multi-focused proof system isomorphic to expansion proofs , 2016, J. Log. Comput..

[10]  Rajeev Goré,et al.  Labelled Tree Sequents, Tree Hypersequents and Nested (Deep) Sequents , 2012, Advances in Modal Logic.

[11]  Melvin Fitting,et al.  Modal proof theory , 2007, Handbook of Modal Logic.

[12]  Sara Negri,et al.  Proof Analysis in Modal Logic , 2005, J. Philos. Log..

[13]  Chuck Liang,et al.  Focusing and polarization in linear, intuitionistic, and classical logics , 2009, Theor. Comput. Sci..

[14]  Elaine Pimentel,et al.  Proof Search in Nested Sequent Calculi , 2015, LPAR.

[15]  Francesca Poggiolesi,et al.  Gentzen Calculi for Modal Propositional Logic , 2010 .

[16]  Zakaria Chihani,et al.  Foundational Proof Certificates in First-Order Logic , 2013, CADE.

[17]  Karin Ackermann,et al.  Labelled Deductive Systems , 2016 .

[18]  Ryo Kashima,et al.  Cut-free sequent calculi for some tense logics , 1994, Stud Logica.

[19]  Dale Miller,et al.  Focused Labeled Proof Systems for Modal Logic , 2015, LPAR.

[20]  Andrea Masini,et al.  2-Sequent Calculus: A Proof Theory of Modalities , 1992, Ann. Pure Appl. Log..

[21]  Björn Lellmann,et al.  Linear Nested Sequents, 2-Sequents and Hypersequents , 2015, TABLEAUX.

[22]  Lutz Straßburger,et al.  Focused and Synthetic Nested Sequents , 2016, FoSSaCS.

[23]  Kazem Sadegh-Zadeh,et al.  Non-Classical Logics , 2015 .

[24]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[25]  Jonas Schreiber.  Natural Deduction Hybrid Systems And Modal Logics , 2016 .

[26]  Luca Viganò,et al.  Labelled non-classical logics , 2000 .

[27]  M. Fitting.  Proof Methods for Modal and Intuitionistic Logics , 1983 .

[28]  Sara Negri.  Logic Colloquium 2005: Proof analysis in non-classical logics , 2007 .

[29]  Melvin Fitting,et al.  Prefixed tableaus and nested sequents , 2012, Ann. Pure Appl. Log..