B and D Are Enough to Make the Halpern–Shoham Logic Undecidable

DOI10.1007/978-3-642-14162-1_30zbMath1288.03016OpenAlexW1532356668MaRDI QIDQ3587452

Jerzy Marcinkowski, Emanuel Kieroński, Jakub Michaliszyn

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_30

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (4)

The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT ⋮ The dark side of interval temporal logic: marking the undecidability border ⋮ Why Systems of Temporal Logic Are Sometimes (Un)useful? ⋮ On a Temporal Logic of Prefixes and Infixes.

This page was built for publication: B and D Are Enough to Make the Halpern–Shoham Logic Undecidable