Tarski's exponential function problem
Let be the language of ordered rings, and let , where is a unary function symbol. Let denote the -structure with underlying set in which the symbols of receive their usual interpretations in the ordered real field and is interpreted as the real exponential function . Let
Then is decidable: there is an effective procedure which, given any -sentence , determines whether
References
Primary source
Additional references
- Wikipedia, Tarski's exponential function problem, the article this problem comes from.
Progress summary
The decision problem is still open, with only conditional results and no verified proof or counterexample.
Tarski’s problem asks whether the first-order theory of the real numbers with addition, multiplication, order, and exponential function is decidable. Tarski had already established decidability for the real field without exponential function.
Known results
- Wilkie, 1996: the real exponential field is model-complete.
- Macintyre and Wilkie, 1996: decidability follows from the real version of Schanuel’s conjecture; a weaker equivalent formulation is also known.
- van den Dries, 1998: the real exponential field does not admit quantifier elimination.
- Berarducci and Servi, 2006: conditional decidability follows from the Transfer Conjecture.
November 2024 update
A preprint on finite models for exponential algebra explicitly states that Tarski’s exponential-function problem remains open and does not provide a direct solution. No verified proof, counterexample, correction, or AI attribution was found.
Current status (as of August 2026): Decidability of remains unsettled; the principal result is conditional on Schanuel-type conjectures.
Solutions 0
No solutions have been posted yet.