A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
From MaRDI portal
Publication:3643267
DOI10.3166/JANCL.14.55-104zbMath1181.03015OpenAlexW1966994121MaRDI QIDQ3643267
Publication date: 11 November 2009
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.14.55-104
Related Items (10)
A separation theorem for discrete-time interval temporal logic ⋮ An application of temporal projection to interleaving concurrency ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ A proof system for unified temporal logic ⋮ A sound and complete proof system for a unified temporal logic ⋮ A decision procedure and complete axiomatization for projection temporal logic ⋮ Verification and enforcement of access control policies ⋮ Guest editors' preface to special issue on interval temporal logics ⋮ Compositional reasoning using intervals and time reversal ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complementation problem for Büchi automata with applications to temporal logic
- A calculus of durations
- \(\infty\)-regular temporal logic and its model checking problem
- Büchi's monadic second order successor arithmetic.
- Sequential method in propositional dynamic logic
- Propositional dynamic logic of regular programs
- Dynamic linear time temporal logic
- A completeness theorem for Kleene algebras and the algebra of regular events
- Temporal logic can be more expressive
- On Bounding the Schur Index of Induced Modules
- Equations between Regular Terms and an Application to Process Logic
- Star-free regular sets of ω-sequences
- A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection
- Complete Proof System for QPTL
- Two Complete Axiom Systems for the Algebra of Regular Events
This page was built for publication: A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
