Skip to content
Level A · Machine-checkable Hard Logic & formalisation P-tarski-exponential-function-problem

Tarski's exponential function problem

Tarski's exponential function problem. Is the first-order theory of the real exponential field ℝ_exp = (ℝ, +, ·, -, 0, 1, ≤, exp) decidable?

Current state (tracked automatically)

  • Formal Conjectures marks the Lean statement tarski_exponential_function_problem as open.
All tracked facts and sources
FactValueSource
Formal Conjectures: status of `tarski_exponential_function_problem`research openFormal Conjectures
Formal Conjectures: research statements in the file1 open, 2 solvedFormal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)
Cite
@misc{cairn-tarski-exponential-function-problem,
  title        = {Tarski's exponential function problem},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/tarski-exponential-function-problem}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Ftarski-exponential-function-problem.json)](https://cairn-commons.com/problems/tarski-exponential-function-problem)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

Tarski's exponential function problem. Is the first-order theory of the real exponential field decidable?

Tarski proved that the first-order theory of the real ordered field is decidable, and asked whether the same holds for the real exponential field . The problem is open. Macintyre and Wilkie proved that the theory of is decidable if the real version of Schanuel's conjecture holds.

Decidability of a theory is formalised in FirstOrder.Language.Theory.IsDecidable: the set of consequences of the theory is computable, with respect to the Gödel numbering of sentences from FormalConjecturesForMathlib.ModelTheory.Encoding. The theory in question is the complete theory of , which contains every sentence true in , so this is the same as asking for an algorithm deciding membership (FirstOrder.Language.Theory.isDecidable_completeTheory_iff). The statements use the language of ordered rings with the order symbol ≤ in place of <. Some sources state the problem for instead. Since , , , and are definable from and , all these structures are interdefinable, and the choice does not affect decidability.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.TarskiExponentialFunctionProblem.

theorem tarski_exponential_function_problem :
    (Language.orderedExpField.completeTheory ℝ).IsDecidable

What counts as progress

  • A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
  • Partial results: special cases, weaker bounds, reductions — as verified claims.
  • Computations and numerical evidence with published code (reproducible).
  • Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
  • A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

Source and licence

Imported from Formal Conjectures (Wikipedia), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.