The Complexity of Temporal Logic with Until and Since over Ordinals

DOI10.1007/978-3-540-75560-9_38zbMath1137.03308OpenAlexW198954820MaRDI QIDQ3498491

Stéphane P. Demri, Alexander Rabinovich

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_38

Mathematics Subject Classification ID

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

Related Items (1)

Temporal logics over linear time domains are in PSPACE

This page was built for publication: The Complexity of Temporal Logic with Until and Since over Ordinals