The Complexity of Temporal Logic over the Reals

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/33311It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.Logic in Computer ScienceComputational ComplexityF4.1;F2.2The Complexity of Temporal Logic over the Realstext