Focusing and polarization in linear, intuitionistic, and classical logics

A focused proof system provides a normal form to cut-free proofs in which the application of invertible and non-invertible inference rules is structured. Within linear logic, the focused proof system of Andreoli provides an elegant and comprehensive normal form for cut-free proofs. Within intuitionistic and classical logics, there are various different proof systems in the literature that exhibit focusing behavior. These focused proof systems have been applied to both the proof search and the proof normalization approaches to computation. We present a new, focused proof system for intuitionistic logic, called LJF, and show how other intuitionistic proof systems can be mapped into the new system by inserting logical connectives that prematurely stop focusing. We also use LJF to design a focused proof system LKF for classical logic. Our approach to the design and analysis of these systems is based on the completeness of focusing in linear logic and on the notion of polarity that appears in Girard's LC and LU proof systems.

[1]  Jean-Marc Andreoli,et al.  Linear objects: Logical processes with built-in inheritance , 1990, New Generation Computing.

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

[3]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[4]  Frank Pfenning,et al.  The focused inverse method for linear logic , 2006 .

[5]  Dale Miller,et al.  Incorporating Tables into Proofs , 2007, CSL.

[6]  Dale Miller,et al.  Forum: A Multiple-Conclusion Specification Logic , 1996, Theor. Comput. Sci..

[7]  Jean-Yves Girard,et al.  On the Unity of Logic , 1993, Ann. Pure Appl. Log..

[8]  Dale Miller,et al.  Focusing and Polarization in Intuitionistic Logic , 2007, CSL.

[9]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[10]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

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

[12]  Radha Jagadeesan,et al.  Testing Concurrent Systems: An Interpretation of Intuitionistic Logic , 2005, FSTTCS.

[13]  Olivier Laurent,et al.  Polarized and focalized linear and classical proofs , 2005, Ann. Pure Appl. Log..

[14]  Frank Pfenning,et al.  A Logical Characterization of Forward and Backward Chaining in the Inverse Method , 2007, Journal of Automated Reasoning.

[15]  Dale Miller,et al.  On focusing and polarities in linear logic and intuitionistic logic , 2006 .

[16]  Hugo Herbelin.  Séquents qu'on calcule: de l'interprétation du calcul des séquents comme calcul de lambda-termes et comme calcul de stratégies gagnantes. (Computing with sequents: on the interpretation of sequent calculus as a calculus of lambda-terms and as a calculus of winning strategies) , 1995 .

[17]  Paul Blain Levy.  Jumbo λ-calculus , 2006 .

[18]  Jacob M. Howe,et al.  Proof search issues in some non-classical logics , 1998 .

[19]  Vincent Danos,et al.  A new deconstructive logic: linear logic , 1997, Journal of Symbolic Logic.

[20]  Roy Dyckhoff,et al.  LJQ: A Strongly Focused Calculus for Intuitionistic Logic , 2006, CiE.

[21]  M. E. Szabo,et al.  The collected papers of Gerhard Gentzen , 1969 .

[22]  Dale Miller,et al.  From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic , 2007, CSL.

[23]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[24]  Jan Łukasiewicz,et al.  On the principle of the excluded middle , 1987 .

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

[26]  Frank Pfenning,et al.  Automated Theorem Proving , 2004 .

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

[28]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

[29]  Vincent Danos,et al.  LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication , 1995 .

[30]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..