Axiomatising extended computation tree logic

DOI10.1016/S0304-3975(97)00083-2MaRDI QIDQ1389439zbMATH OpenOpenAlexFDO

Authors 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

completenesstemporal logicsaxiomatisationlimit closure

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Axiomatising extended computation tree logic
• An axiomatization of full computation tree logic
• Extended computation tree logic
• Paraconsistent computation tree logic
• Quantified computation tree logic
• Extended full computation-tree logics for paraconsistent model checking
• scientific article; zbMATH DE number 2086419
• Axiomatising tree-interpretable structures
• Consistency and axiomatization of a natural extensional combinatory logic
• Graded computation tree logic

Cites work

• scientific article; zbMATH DE number 3876574 (Why is no real title available?)
• scientific article; zbMATH DE number 3990873 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 4128366 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 4119650 (Why is no real title available?)
• Alternative semantics for temporal logics
• An automata theoretic decision procedure for the propositional mu- calculus
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Deciding full branching time logic
• Decision procedures and expressiveness in the temporal logic of branching time
• Local model checking in the modal mu-calculus
• Reasoning about infinite computations
• Results on the propositional \(\mu\)-calculus
• Temporal logic can be more expressive
• Testing and generating infinite sequences by a finite automaton

Cited in

(8)

• A propositional probabilistic logic with discrete linear time for reasoning about evidence
• Axiomatising extended computation tree logic
• An axiomatization of PCTL*
• An axiomatization of ECTL
• An axiomatization of full computation tree logic
• Extended computation tree logic
• Axiomatising tree-interpretable structures
• scientific article; zbMATH DE number 3913664 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389439)