Temporal logics with incommensurable distances are undecidable

DOI10.1016/j.ic.2006.11.002zbMath1128.03009OpenAlexW2131379151MaRDI QIDQ879597

Alexander Rabinovich

Publication date: 14 May 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.11.002

zbMATH Keywords

undecidabilitytemporal logicmetric properties

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)

Related Items (1)

MTL with Bounded Variability: Decidability and Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An undecidable problem for timed automata
• Models for reactivity
• Timer formulas and decidable metric temporal logic
• The benefits of relaxing punctuality

This page was built for publication: Temporal logics with incommensurable distances are undecidable