The complexity of linear-time temporal logic over the class of ordinals

DOI10.2168/LMCS-6(4:9)2010zbMath1213.03027arXiv1009.5206MaRDI QIDQ3081444

Stéphane P. Demri, Alexander Rabinovich

Publication date: 8 March 2011

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.5206

zbMATH Keywords

ordinalsatisfiability problempolynomial spacelinear-time temporal logicordinal automaton

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (2)

A propositional linear time logic with time flow isomorphic to \(\omega^2\) ⋮ Unnamed Item

This page was built for publication: The complexity of linear-time temporal logic over the class of ordinals