The Complexity of Temporal Logic over the Reals
Abstract
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.