Tarski's exponential function problem

Tarski's exponential function problem

In model theory, Tarski's exponential function problem asks whether the usual theory of the real numbers together with the exponential function is decidable. Tarski had previously shown that the theory of the real numbers (without the exponential function) is decidable.

The problem

The ordered real field R is a structure over the language of ordered rings Lor = (+,·,−,<,0,1), with the usual interpretation given to each symbol. It was proved by Tarski that the theory of the real field, Th(R), is decidable. That is, given any Lor-sentence φ there is an effective procedure for determining whether

\operatorname{Th}(\R)\models\varphi.

He then asked whether this was still the case if one added a unary function exp to the language that was interpreted as the exponential function on R, to get the structure Rexp.

Conditional and equivalent results

The problem can be reduced to finding an effective procedure for determining whether any given exponential polynomial in n variables and with coefficients in Z has a solution in Rn. Macintyre & Wilkie (1995) showed that Schanuel's conjecture implies such a procedure exists, and hence gave a conditional solution to Tarski's problem. Schanuel's conjecture deals with all complex numbers so would be expected to be a stronger result than the decidability of Rexp, and indeed, Macintyre and Wilkie proved that only a real version of Schanuel's conjecture is required to imply the decidability of this theory.

Even the real version of Schanuel's conjecture is not a necessary condition for the decidability of the theory. In their paper, Macintyre and Wilkie showed that an equivalent result to the decidability of Th(Rexp) is what they dubbed the Weak Schanuel's Conjecture. This conjecture states that there is an effective procedure that, given n ≥ 1 and exponential polynomials in n variables with integer coefficients f1,..., fn, g, produces an integer η ≥ 1 that depends on n, f1,..., fn, g, and such that if α ∈ Rn is a non-singular solution of the system

f_1(x_1,\ldots,x_n,e^{x_1},\ldots,e^{x_n})=\ldots=f_n(x_1,\ldots,x_n,e^{x_1},\ldots,e^{x_n})=0

then either g(α) = 0 or |g(α)| > η−1.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Tarski's problem — Alfred Tarski asked several mathematical questions: *For Tarski s problem about the elementary theory of free groups see free group. *Tarski s circle squaring problem *Tarski s plank problem *Tarski s exponential function problem *Tarski monster… …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • List of mathematics articles (T) — NOTOC T T duality T group T group (mathematics) T integration T norm T norm fuzzy logics T schema T square (fractal) T symmetry T table T theory T.C. Mits T1 space Table of bases Table of Clebsch Gordan coefficients Table of divisors Table of Lie …   Wikipedia

  • Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

  • Schanuel's conjecture — In mathematics, specifically transcendence theory, Schanuel s conjecture is the following statement::Given any n complex numbers z 1,..., z n which are linearly independent over the rational numbers Q, the extension field Q( z 1,..., z n ,exp( z… …   Wikipedia

  • List of first-order theories — In mathematical logic, a first order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties. PreliminariesFor every natural mathematical structure… …   Wikipedia

  • Real number — For the real numbers used in descriptive set theory, see Baire space (set theory). For the computing datatype, see Floating point number. A symbol of the set of real numbers …   Wikipedia

  • Per Martin-Löf — in 2004 Born May 8, 1942 (194 …   Wikipedia

  • List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …   Wikipedia

  • Matrix (mathematics) — Specific elements of a matrix are often denoted by a variable with two subscripts. For instance, a2,1 represents the element at the second row and first column of a matrix A. In mathematics, a matrix (plural matrices, or less commonly matrixes)… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”