Computational complexity of determining which statements about causality hold in different space–time models

Authors:
Vladik Kreinovich;Olga Kosheleva
Affiliations:
University of Texas at El Paso, El Paso, TX 79968, USA;University of Texas at El Paso, El Paso, TX 79968, USA
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 2

The complexity of elementary algebra and geometry

Journal of Computer and System Sciences
Real quantifier elimination is doubly exponential

Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation
On the computational complexity and geometry of the first-order theory of the reals. Part III: quantifier elimination

Journal of Symbolic Computation
Efficient solving of quantified inequality constraints over the real numbers

ACM Transactions on Computational Logic (TOCL)

Metrization theorem for space-times: From urysohn's problem towards physically useful constructive mathematics

Fields of logic and computation
Reconstructing an Open Order from Its Closure, with Applications to Space-Time Physics and to Logic

Studia Logica

Quantified Score

Hi-index	5.23

Visualization

Abstract

Causality is one of the most fundamental notions of physics. It is therefore important to be able to decide which statements about causality are correct in different models of space-time. In this paper, we analyze the computational complexity of the corresponding decision problems. In particular, we show that: *for Minkowski space-time, the decision problem is as difficult as Tarski's decision problem for elementary geometry, while *for a natural model of primordial space-time, the corresponding decision problem is of the lowest possible complexity among all possible space-time models.