Hypersequent Calculi for S5: The Methods of Cut Elimination

S5 is one of the most important modal logic with nice syntactic, semantic and algebraic properties. In spite of that, a successful (i.e. cut-free) formalization of S5 on the ground of standard sequent calculus (SC) was problematic and led to the invention of numerous nonstandard, generalized forms of SC. One of the most interesting framework which was very often used for this aim is that of hypersequent calculi (HC). The paper is a survey of HC for S5 proposed by Pottinger, Avron, Restall, Poggiolesi, Lahav and Kurokawa. We are particularly interested in examining different methods which were used for proving the eliminability/admissibility of cut in these systems and present our own variant of a system which admits relatively simple proof of cut elimination.

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

[2]  Andrzej Indrzejczak,et al.  Cut-free Double Sequent Calculus for S5 , 1998, Log. J. IGPL.

[3]  Torben Braüner,et al.  A Cut-Free Gentzen Formulation of the Modal Logic S5 , 2000, Log. J. IGPL.

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

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

[6]  Arnon Avron,et al.  Hypersequents, logical consequence and intermediate logics for concurrency , 1991, Annals of Mathematics and Artificial Intelligence.

[7]  Francesca Poggiolesi,et al.  A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5 , 2008, The Review of Symbolic Logic.

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

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

[10]  Matthias Baaz,et al.  A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic , 2002, TABLEAUX.

[11]  Andrzej Indrzejczak,et al.  Cut-free Hypersequent Calculus for S4.3 , 2012 .

[12]  Franco Montagna,et al.  Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions , 2010, Fuzzy Sets Syst..

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

[14]  Francesca Poggiolesi.  Proof Analysis. A Contribution to Hilbert's Last Problem , 2013 .

[15]  Andrzej Indrzejczak,et al.  Eliminability of cut in hypersequent calculi for some modal logics of linear frames , 2015, Inf. Process. Lett..

[16]  Ori Lahav,et al.  From Frame Properties to Hypersequent Rules in Modal Logics , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[17]  Arnon Avron,et al.  A constructive analysis of RM , 1987, Journal of Symbolic Logic.

[18]  Greg Restall,et al.  Proofnets for S5: sequents and circuits for modal logic , 2007 .

[19]  D. Gabbay,et al.  Proof Theory for Fuzzy Logics , 2008 .

[20]  G. Mints,et al.  Cut-Free Calculi of the S5 Type , 1970 .

[21]  Arnon Avron,et al.  A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic , 2011, J. Log. Comput..

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

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

[24]  Hidenori Kurokawa,et al.  Hypersequent Calculi for Modal Logics Extending S4 , 2013, JSAI-isAI Workshops.

[25]  J. Girard.  Proof Theory and Logical Complexity , 1989 .

[26]  Haskell B. Curry,et al.  Foundations of Mathematical Logic , 1964 .

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

[28]  Heinrich Wansing,et al.  Hypersequent and Display Calculi – a Unified Perspective , 2014, Studia Logica.

[29]  Kazuo Matsumoto,et al.  Gentzen method in modal calculi. II , 1957 .

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

[31]  Christian G. Fermüller,et al.  Hypersequent Calculi for Gödel Logics - a Survey , 2003, J. Log. Comput..