On the Proof Theory of Regular Fixed Points - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
baelde09tableaux.pdf (160.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00772502 , version 1 (10-01-2013)


  • HAL Id : hal-00772502 , version 1


David Baelde. On the Proof Theory of Regular Fixed Points. Automated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, Jul 2009, Oslo, Norway. ⟨hal-00772502⟩
82 View
146 Download


Gmail Facebook X LinkedIn More