The Temporal Logic of two dimensional Minkowski spacetime is decidable
Robin Hirsch, Mark Reynolds

TL;DR
This paper proves that the temporal logic of two-dimensional Minkowski spacetime with irreflexive accessibility is decidable and PSPACE-complete, advancing understanding of spacetime logic and its computational complexity.
Contribution
It establishes the decidability and PSPACE-completeness of the temporal logic for irreflexive Minkowski spacetime, a long-standing open problem in the field.
Findings
Decidability of the logic for irreflexive case proven.
Complexity classified as PSPACE-complete.
Formulas distinguishing spacetime dimensions and underlying fields provided.
Abstract
We consider Minkowski spacetime, the set of all point-events of spacetime under the relation of causal accessibility. That is, can access if an electromagnetic or (slower than light) mechanical signal could be sent from to . We use Prior's tense language of and representing causal accessibility and its converse relation. We consider two versions, one where the accessibility relation is reflexive and one where it is irreflexive. In either case it has been an open problem, for decades, whether the logic is decidable or axiomatisable. We make a small step forward by proving, for the case where the accessibility relation is irreflexive, that the set of valid formulas over two-dimensional Minkowski spacetime is decidable, decidability for the reflexive case follows from this. The complexity of either problem is PSPACE-complete. A…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
