Related papers: Temporal Logic of Minkowski Spacetime

Using only the principle of relativity and Euclidean geometry we show in this pedagogical article that the square of proper time or length in a two-dimensional spacetime diagram is proportional to the Euclidean area of the corresponding…

We prove a globally hyperbolic spacetime with locally Lipschitz continuous metric and timelike distributional Ricci curvature bounded from below obeys the timelike measure contraction property. The remarkable class of examples of spacetimes…

We show that a topology can be defined in the four dimensional space-time of special relativity so as to obtain a topological semigroup for time. The Minkowski 4-vector character of space-time elements as well as the key properties of…

We present a novel derivation of both the Minkowski metric and Lorentz transformations from the consistent quantification of a causally ordered set of events with respect to an embedded observer. Unlike past derivations, which have relied…

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

In this paper, we address complexity issues for timeline-based planning over dense temporal domains. The planning problem is modeled by means of a set of independent, but interacting, components, each one represented by a number of state…

This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability (or undecidability) results,…

The language of linear temporal logic can be interpreted over the class of dynamic topological systems, giving rise to the intuitionistic temporal logic ${{\sf ITL}^{\sf c}}_{\Diamond,\forall}$, recently shown to be decidable by…

Friedrich's proofs for the global existence results of de Sitter-like space-times and of semi-global existence of Minkowski-like space-times [Comm. Math. Phys. \textbf{107}, 587 (1986)] are re-examined and discussed, making use of the…

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse…

In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional…

It is known that many modal and superintuitionistic logics are PSPACE-hard in languages with a small number of variables; however, questions about the complexity of similar fragments of many logics obtained by adding various axioms to…

We prove that an isometric immersion of a timelike surface in four-dimensional Minkowski space is equivalent to a normalized spinor field which is a solution of a Dirac equation on the surface. Using the quaternions and the complex numbers,…

The concept of Euclidean time is proposed which is dual to the usual Minkowski time. The De Sitter solution is shown to be dual to the anti-De Sitter solution under the dual transformation in which Euclidean time and Minkowski time are…

We study geometry of two-dimensional models of conformal space-time based on the group of Moebius transformation. The natural geometric invariants, called cycles, are used to linearise Moebius action. Conformal completion of the space-time…

Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…

Several calculations in conformally static spacetimes rely on the introduction of an ultrastatic background. I describe the general properties of ultrastatic spacetimes, and then focus on the problem of whether a given spacetime can be…

We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…