Local Validity for Circular Proofs in Linear Logic with Fixed Points

Circular (ie. non-wellfounded but regular) proofs have received increasing interest in recent years with the simultaneous development of their applications and meta-theory: infinitary proof theory is now well-established in several proof-theoretical frameworks such as Martin Löf’s inductive predicates, linear logic with fixed points, etc. In the setting of non-wellfounded proofs, a validity criterion is necessary to distinguish, among all infinite derivation trees (aka. pre-proofs), those which are logically valid proofs. A standard approach is to consider a pre-proof to be valid if every infinite branch is supported by an infinitely progressing thread. The paper focuses on circular proofs for MALL with fixed points. Among all representations of valid circular proofs, a new fragment is described, based on a stronger validity criterion. This new criterion is based on a labelling of formulas and proofs, whose validity is purely local. This allows this fragment to be easily handled, while being expressive enough to still contain all circular embeddings of Baelde’s μMALL finite proofs with (co)inductive invariants: in particular deciding validity and computing a certifying labelling can be done efficiently. Moreover the BrotherstonSimpson conjecture holds for this fragment: every labelled representation of a circular proof in the fragment is translated into a standard finitary proof. Finally we explore how to extend these results to a bigger fragment, by relaxing the labelling discipline while retaining (i) the ability to locally certify the validity and (ii) to some extent, the ability to finitize circular proofs. 2012 ACM Subject Classification Theory of computation → Logic, Theory of computation → Proof theory, Theory of computation → Linear logic, Theory of computation → Logic and verification

[1]  Alexis Saurin,et al.  Infinitary proof theory : the multiplicative additive case , 2018 .

[2]  Amina Doumane,et al.  On the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes) , 2017 .

[3]  James Brotherston,et al.  Sequent calculi for induction and infinite descent , 2011, J. Log. Comput..

[4]  Martin Hofmann,et al.  A Proof System for the Linear Time µ-Calculus , 2006, FSTTCS.

[5]  Makoto Tatsuta,et al.  Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System , 2017, FoSSaCS.

[6]  Luigi Santocanale,et al.  A Calculus of Circular Proofs and Its Categorical Semantics , 2001, FoSSaCS.

[7]  J. Brotherston Sequent calculus proof systems for inductive definitions , 2006 .

[8]  Igor Walukiewicz,et al.  Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[9]  L. Hirschi,et al.  Towards Completeness via Proof Search in the Linear Time mu-Calculus , 2016 .

[10]  David Baelde On the Proof Theory of Regular Fixed Points , 2009, TABLEAUX.

[11]  Pierre Clairambault,et al.  Least and Greatest Fixpoints in Game Semantics , 2009, FICS.

[12]  James Brotherston,et al.  Complete Sequent Calculi for Induction and Infinite Descent , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[13]  James Brotherston,et al.  A Generic Cyclic Theorem Prover , 2012, APLAS.

[14]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[15]  Igor Walukiewicz On completeness of the mu -calculus , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[16]  David Baelde,et al.  Least and Greatest Fixed Points in Linear Logic , 2007, TOCL.

[17]  Graham Emil Leigh,et al.  Cut-free completeness for modal mu-calculus , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[18]  Makoto Tatsuta,et al.  Equivalence of inductive definitions and cyclic proofs under arithmetic , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[19]  Luigi Santocanale,et al.  Cuts for circular proofs , 2013, TACL.