2000 character limit reached
Temporal Logic of Minkowski Spacetime
Published 3 Oct 2020 in math.LO | (2010.01321v1)
Abstract: We present the proof that the temporal logic of two-dimensional Minkowski spacetime is decidable, PSPACE-complete. The proof is based on a type of two-dimensional mosaic. Then we present the modification of the proof so as to work for slower-than-light signals. Finally, a subframe of the slower-than-light Minkowski frame is used to prove the new result that the temporal logic of real intervals with during as the accessibility relation is also PSPACE-complete.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.