Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T

DOI10.1007/978-3-540-87531-4_23MaRDI QIDQ3540187zbMATH OpenOpenAlexFDO

Authors Angelo Montanari, Guido Sciavicco, Ian Hodkinson

Publication date 20 November 2008

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87531-4_23

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 991155
• scientific article; zbMATH DE number 1696444
• The dark side of interval temporal logic: marking the undecidability border
• A complete axiom system for propositional interval temporal logic with infinite time
• Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification
• On coarser interval temporal logics
• A decidable intuitionistic temporal logic
• Completeness of temporal logics over infinite intervals.
• scientific article; zbMATH DE number 1670826
• A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time

Cited in

(7)

• A survey on temporal logics for specifying and verifying real-time systems
• The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
• On a Temporal Logic of Prefixes and Infixes.
• Inference rules in multi-agents' temporal logics
• scientific article; zbMATH DE number 991155 (Why is no real title available?)
• \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
• On temporal and separation logics

This page was built for publication: Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T

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