Decidability of first-order theories of the real numbers
A first-order language of the real numbers is the set of all well-formed sentences of first-order logic that involve universal and existential quantifiers and logical combinations of equalities and inequalities of expressions over real variables. The corresponding first-order theory is the set of sentences that are actually true of the real numbers. There are several different such theories, with different expressive power, depending on the primitive operations that are allowed to be used in the expression. A fundamental question in the study of these theories is whether they are decidable: that is, is there an algorithm that can take a sentence as input and produce as output a yes or no answer to the question of whether the sentence belongs to the theory.
The theory of real closed fields is the theory in which the primitives are multiplication and addition; that is, in this theory, comparisons are possible only between polynomials. It is decidable, a fact known as the Tarski–Seidenberg theorem. This was first proved by Alfred Tarski; see Tarski–Seidenberg theorem and Quantifier elimination. Current implementations of decision procedures for the theory of real closed fields are often based on quantifier elimination by cylindrical algebraic decomposition.
Tarski's exponential function problem concerns the extension of this theory to another primitive operation, the exponential function. It is an open problem whether it is decidable, but if Schanuel's conjecture holds then the decidability of this theory would follow.[1][2] In contrast, the extension of the theory of real closed fields with the sine function is undecidable since this allows encoding of the undecidable theory of integers (see Matiyasevich's theorem).
Still, one can handle the undecidable case with functions such as sine by using algorithms that do not necessarily terminate always. Especially, one can design algorithms that are only required to terminate for input formulas that are robust, that is, formulas, whose satisfiability does not change if the formula is slightly perturbed.[3] Alternatively, it is also possible to use purely heuristic approaches.[4]
