Page 1 Next

Displaying 1 – 20 of 23

Showing per page

A Note on Negative Tagging for Least Fixed-Point Formulae

Dilian Gurov, Bruce Kapron (2010)

RAIRO - Theoretical Informatics and Applications

Proof systems with sequents of the form U ⊢ Φ for proving validity of a propositional modal μ-calculus formula Φ over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without...

On global induction mechanisms in a μ -calculus with explicit approximations

Christoph Sprenger, Mads Dam (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate a Gentzen-style proof system for the first-order μ -calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantic...

On global induction mechanisms in a μ-calculus with explicit approximations

Christoph Sprenger, Mads Dam (2010)

RAIRO - Theoretical Informatics and Applications

We investigate a Gentzen-style proof system for the first-order μ-calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantic...

Currently displaying 1 – 20 of 23

Page 1 Next