Deep sequent systems for modal logic

We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference but otherwise stay very close to Gentzen’s sequent calculus, in particular they enjoy a subformula property in the literal sense. No semantic notions are used inside the proof systems, in particular there is no use of labels. All their rules are invertible and the rules cut, weakening and contraction are admissible. All systems admit a straightforward terminating proof search procedure as well as a syntactic cut elimination procedure.

[1]  Francesca Poggiolesi,et al.  The Method of Tree-Hypersequents for Modal Propositional Logic , 2009, Towards Mathematical Philosophy.

[2]  Charles A. Stewart,et al.  Purity through Unravelling , 2005 .

[3]  Heinrich Wansing,et al.  Sequent Systems for Modal Logics , 2002 .

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

[5]  Kai Brünnler.  Deep inference and symmetry in classical proofs , 2003 .

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

[7]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[8]  S. Martini,et al.  A Computational Interpretation of Modal Proofs , 1996 .

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

[10]  Kai Br.  Deep Sequent Systems for Modal Logic , 2006 .

[11]  H. Wansing.  Displaying Modal Logic , 1998 .

[12]  Lutz Straßburger,et al.  Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.

[13]  Phiniki Stouppa.  A Deep Inference System for the Modal Logic S5 , 2007, Stud Logica.

[14]  Nuel Belnap,et al.  Display logic , 1982, J. Philos. Log..

[15]  M. Sato.  A Study of Kripke-type Models for Some Modal Logics by Gentzen's Sequential Method , 1977 .

[16]  Alwen Tiu,et al.  A Local System for Classical Logic , 2001, LPAR.

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

[18]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[19]  Robert A. Bull.  Cut Elimination for Propositional Dynamic Logic without , 1992, Math. Log. Q..

[20]  Helmut Schwichtenberg,et al.  Basic proof theory , 1996, Cambridge tracts in theoretical computer science.

[21]  Lutz Straßburger,et al.  Linear logic and noncommutativity in the calculus of structures , 2003 .

[22]  Alessio Guglielmi,et al.  A system of interaction and structure , 1999, TOCL.