Afshari, Bahareh
[Author];
Leigh, Graham E.
[Author];
Menéndez Turata, Guillermo
[Author]
;
Bahareh Afshari and Graham E. Leigh and Guillermo Menéndez Turata
[Contributor]
A Cyclic Proof System for Full Computation Tree Logic
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
Full Computation Tree Logic, commonly denoted CTL*, is the extension of Linear Temporal Logic LTL by path quantification for reasoning about branching time. In contrast to traditional Computation Tree Logic CTL, the path quantifiers are not bound to specific linear modalities, resulting in a more expressive language. We present a sound and complete hypersequent calculus for CTL*. The proof system is cyclic in the sense that proofs are finite derivation trees with back-edges. A syntactic success condition on non-axiomatic leaves guarantees soundness. Completeness is established by relating cyclic proofs to a natural ill-founded sequent calculus for the logic.