Temporal Logics with Reference Pointers and Computation Tree Logics

DOI10.1080/11663081.2000.10510998zbMath1033.03022MaRDI QIDQ4443400

Valentin F. Goranko

Publication date: 11 January 2004

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2000.10510998

zbMATH Keywords

completeness; axiomatic system; branching time temporal logic; reference pointers; branching time computation tree logic

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

03B44: Temporal logic

Related Items

Annotation theories over finite graphs, On the Hybrid Extension of CTL and CTL +

Cites Work

• Unnamed Item
• Unnamed Item
• An essay in combinatory dynamic logic
• Axiomatising the logic of computer programming
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse.
• Modal logic with names
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• A first-order axiomatization of the theory of finite trees
• Hybrid languages
• Hierarchies of modal and temporal logics with reference pointers
• The decision problem for branching time logic
• Deciding full branching time logic
• Hybrid completeness
• Hybrid languages and temporal logic
• Derivation rules as anti-axioms in modal logic
• Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
• Branching-time logic with quantification over branches: The point of view of modal logic
• Internalizing labelled deduction