The temporal logic of two-dimensional Minkowski spacetime with slower-than-light accessibility is decidable

06/26/2018
by   Robin Hirsch, et al.
0

We work primarily with the Kripke frame consisting of two-dimensional Minkowski spacetime with the irreflexive accessibility relation 'can reach with a slower-than-light signal'. We show that in the basic temporal language, the set of validities over this frame is decidable. We then refine this to PSPACE-complete. In both cases the same result for the corresponding reflexive frame follows immediately. With a little more work we obtain PSPACE-completeness for the validities of the Halpern-Shoham logic of intervals on the real line with two different combinations of modalities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2017

A Proof of Stavi's Theorem

Kamp's theorem established the expressive equivalence of the temporal lo...
research
06/14/2022

EXPTIME-hardness of higher-dimensional Minkowski spacetime

We prove the EXPTIME-hardness of the validity problem for the basic temp...
research
02/16/2022

The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete

A classic result by Stockmeyer gives a non-elementary lower bound to the...
research
09/17/2021

Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete

The choice of the right trade-off between expressiveness and complexity ...
research
03/14/2019

A two-dimensional metric temporal logic

We introduce a two-dimensional metric (interval) temporal logic whose in...
research
09/01/2023

Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics

We derive an intuitionistic version of Gödel-Löb modal logic (GL) in the...
research
07/27/2017

Cheryl's Birthday

We present four logic puzzles and after that their solutions. Joseph Yeo...

Please sign up or login with your details

Forgot password? Click here to reset