Axiomatising extended computation tree logic

DOI10.1016/S0304-3975(97)00083-2zbMath0893.68146OpenAlexW2155725785MaRDI QIDQ1389439

Roope Kaivola

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00083-2

zbMATH Keywords

completenesslimit closureaxiomatisationtemporal logics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (1)

A propositional probabilistic logic with discrete linear time for reasoning about evidence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• An automata theoretic decision procedure for the propositional mu- calculus
• Local model checking in the modal mu-calculus
• Reasoning about infinite computations
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Alternative semantics for temporal logics
• Decision procedures and expressiveness in the temporal logic of branching time
• Temporal logic can be more expressive
• Deciding full branching time logic
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Axiomatising extended computation tree logic