The Undecidability of the Logic of Subintervals

DOI10.3233/FI-2014-1011zbMath1315.03027OpenAlexW1786588788MaRDI QIDQ5415296

Jerzy Marcinkowski, Jakub Michaliszyn

Publication date: 12 May 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-1011

zbMATH Keywords

Halpern-Shoham logiclogic of subintervalsundecidable logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (19)

A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases ⋮ Complexity analysis of a unifying algorithm for model checking interval temporal logic ⋮ Mining approximate interval-based temporal dependencies ⋮ Checking interval properties of computations ⋮ Model checking interval temporal logics with regular expressions ⋮ \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes ⋮ Fuzzy Halpern and Shoham's interval temporal logics ⋮ Interval Temporal Logic for Visibly Pushdown Systems ⋮ Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives ⋮ Unnamed Item ⋮ Interval vs. Point Temporal Logic Model Checking ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments ⋮ On a Temporal Logic of Prefixes and Infixes. ⋮ Dyck Algebras, Interval Temporal Logic, and Posets of Intervals ⋮ On coarser interval temporal logics ⋮ Computational complexity of hybrid interval temporal logics

This page was built for publication: The Undecidability of the Logic of Subintervals