On the Proof Theory of Regular Fixed Points

We consider encoding finite automata as least fixed points in a proof-theoretical framework equipped with a general induction scheme, and study automata inclusion in that setting. We provide a coinductive characterization of inclusion that yields a natural bridge to proof-theory. This leads us to generalize these observations to regular formulas , obtaining new insights about inductive theorem proving and cyclic proofs in particular.

[1]  Gopalan Nadathur,et al.  The Bedwyr System for Model Checking over Syntactic Expressions , 2007, CADE.

[2]  Dale Miller,et al.  A proof theory for generic judgments , 2005, TOCL.

[3]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[4]  Rance Cleaveland,et al.  Tableau-based model checking in the propositional mu-calculus , 1990, Acta Informatica.

[5]  Luigi Santocanale.  A Calculus of Circular Proofs and Its Categorical Semantics , 2002, FoSSaCS.

[6]  Gopalan Nadathur,et al.  Mixing Finite Success and Finite Failure in an Automated Prover , 2005 .

[7]  A. Tiu.  Model Checking for π-Calculus Using Proof Search , 2005 .

[8]  Mads Dam,et al.  On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus , 2003, FoSSaCS.

[9]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[10]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

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

[12]  Alberto Momigliano,et al.  Induction and Co-induction in Sequent Calculus , 2003, TYPES.

[13]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[14]  Peter Schroeder-Heister,et al.  Rules of definitional reflection , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[15]  Dale Miller,et al.  Cut-elimination for a logic with definitions and induction , 2000, Theor. Comput. Sci..

[16]  James Brotherston,et al.  Cyclic Proofs for First-Order Logic with Inductive Definitions , 2005, TABLEAUX.

[17]  Maribel Fernández,et al.  Curry-Style Types for Nominal Terms , 2006, TYPES.

[18]  Frank Pfenning,et al.  Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings , 2007, CADE.