Related papers: The Temporal Logic of two dimensional Minkowski sp…
A two-dimensional Minkowski spacetime diagram is neatly represented on a Euclidean ordinary plane. However the Euclidean lengths of the lines on the diagram do not correspond to the true values of physical quantities in spacetime, except…
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…
The aim of our paper is twofold: firstly we present a sequent calculus for an intuitionistic non-Fregean logic ISCI, which is based on the calculus presented in the paper by Chlebowski and Leszczynska-Jasion, 'An Investigation into…
We formalize the concept of subtime -- a reversible mode of information interchange within entangled systems -- and show how classical time emerges as an asymptotic limit through decoherence. Building on the photon clock model, in which a…
The assumptions of necessary rationality and necessary knowledge of strategies, also known as perfect prediction, lead to at most one surviving outcome, immune to the knowledge that the players have of them. Solutions concepts implementing…
Our main purpose here is to study some qualitative aspects of space and time. These include the notion of space and time regarded as the containers of respectively bodies and events, the divisibility of space, and the unrepeatability of…
Starting from a discussion of the concrete representations of the coordinates of the k-Minkowski spacetime (in 1+1 dimensions, for simplicity), we explicitly compute the associated Weyl operators as functions of a pair of Schroedinger…
In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with…
The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of…
Hyperproperties, like observational determinism or symmetry, cannot be expressed as properties of individual computation traces, because they describe a relation between multiple computation traces. HyperLTL is a temporal logic that…
We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of…
We show that all languages accepted in time f(n) >= n^2 can be accepted in space O(f(n)^{1/2})_and_ in time O(f(n)). The proof is carried out by simulation, based on the idea of guessing the sequences of internal states of the simulated TM…
We present a new method for embedding a causal set into an interval of Minkowski spacetime. The method uses spacetime volumes for causally related elements to define causal set analogs of Minkowski inner products. These are used to…
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…
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 consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…
In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…
The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…