Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents

Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, following S. Negri's general method for devising sequent calculi for normal modal logics. Although it arises as a natural formalization of the Kripke semantics, it is does not directly support proof search. To describe a proof search procedure, we develop a more algorithmic version that also allows for counter-model extraction from a failed proof attempt.

[1]  Roy Dyckho.  Loop � free construction of counter � models for intuitionistic propositional logic , 1995 .

[2]  Andrzej Filinski.  Declarative Continuations: an Investigation of Duality in Programming Language Semantics , 1989, Category Theory and Computer Science.

[3]  Grigori Mints,et al.  Gentzen-type systems and resolution rules. Part I. Propositional logic , 1990, Conference on Computer Logic.

[4]  Rajeev Goré,et al.  A Cut-Free Sequent Calculus for Bi-intuitionistic Logic , 2007, TABLEAUX.

[5]  Milton Cesar de Goes.  UNIVERSIDADE DE TRÁS-OS-MONTES E ALTO DOURO , 2011 .

[6]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[7]  Andrew M. Pitts,et al.  Category Theory and Computer Science , 1987, Lecture Notes in Computer Science.

[8]  Rajeev Goré,et al.  Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents , 2008, Advances in Modal Logic.

[9]  Roy Dyckhoff,et al.  Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[10]  C. Rauszer.  Applications of Kripke models to Heyting-Brouwer logic , 1977 .

[11]  C. Rauszer.  Semi-Boolean algebras and their applications to intuitionistic logic with dual operations , 1974 .

[12]  Rajeev Goré,et al.  Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic , 2010, J. Log. Comput..

[13]  Hugo Herbelin,et al.  The duality of computation , 2000, ICFP '00.

[14]  Rajeev Goré,et al.  Dual Intuitionistic Logic Revisited , 2000, TABLEAUX.

[15]  Tristan Crolard,et al.  Subtractive logic , 2001, Theor. Comput. Sci..

[16]  Greg Restall,et al.  Extending Intuitionistic Logic with Subtraction , 1997 .

[17]  Cecylia Rauszer,et al.  A formalization of the propositional calculus of H-B logic , 1974 .

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