Elementary function arithmetic
In proof theory, a branch of mathematical logic, elementary function arithmetic or exponential function arithmetic (EFA) is the system of arithmetic with the usual elementary properties of 0, 1, +, ×, xy, together with induction for formulas with bounded quantifiers.
EFA is a very weak logical system, whose proof theoretic ordinal is ω3, but still seems able to prove much of ordinary mathematics that can be stated in the language of first-order arithmetic.
EFA is a system in first order logic (with equality). Its language contains:
- two constants 0, 1,
- three binary operations +, ×, exp, with exp(x,y) usually written as xy,
- a binary relation symbol < (This is not really necessary as it can be written in terms of the other operations and is sometimes omitted, but is convenient for defining bounded quantifiers).
Bounded quantifiers are those of the form ∀(x<y) and ∃ (x<y) which are abbreviations for ∀ x (x<y)→,,, and ∃x (x<y)∧... in the usual way.
The axioms of EFA are
- The axioms of Robinson arithmetic for 0, 1, +, ×, <
- The axioms for exponentiation: x0 = 1, xy+1 = xy×x.
- Induction for formulas all of whose quantifiers are bounded (but which may contain free variables).
Friedman's grand conjecture
The original statement of the conjecture from Friedman (1999) is:
- "Every theorem published in the Annals of Mathematics whose statement involves only finitary mathematical objects (i.e., what logicians call an arithmetical statement) can be proved in EFA. EFA is the weak fragment of Peano Arithmetic based on the usual quantifier-free axioms for 0, 1, +, ×, exp, together with the scheme of induction for all formulas in the language all of whose quantifiers are bounded."
While it is easy to construct artificial arithmetical statements that are true but not provable in EFA, the point of Friedman's conjecture is that natural examples of such statements in mathematics seem to be rare. Some natural examples include consistency statements from logic, several statements related to Ramsey theory such as Szemerédi's lemma and the graph minor theorem, and Tarjan's algorithm for the disjoint-set data structure.
One can omit the binary function symbol exp from the language, by taking Robinson arithmetic together with induction for all formulas with bounded quantifiers and an axiom stating roughly that exponentiation is a function defined everywhere. This is similar to EFA and has the same proof theoretic strength, but is more cumbersome to work with.
There are weak fragments of second-order arithmetic called RCA*
0 and WKL*
0 that have the same consistency strength as EFA and are conservative over it for Π0
2 sentences, which are sometimes studied in reverse mathematics (Simpson 2009).
Elementary recursive arithmetic (ERA) is a subsystem of primitive recursive arithmetic in which recursion is restricted to bounded sums and products. This also has the same Π0
2 sentences as EFA, in the sense that whenever EFA proves ∀x∃y P(x,y), with P quantifier-free, ERA proves the open formula P(x,T(x)), with T a term definable in ERA.
- ELEMENTARY, a related computational complexity class
- Grzegorczyk hierarchy
- Reverse mathematics
- Tarski's high school algebra problem
- Avigad, Jeremy (2003), "Number theory and elementary arithmetic", Philosophia Mathematica. Philosophy of Mathematics, its Learning, and its Application. Series III 11 (3): 257–284, doi:10.1093/philmat/11.3.257, ISSN 0031-8019, MR 2006194
- Friedman, Harvey (1999), grand conjectures
- Simpson, Stephen G. (2009), Subsystems of second order arithmetic, Perspectives in Logic (2nd ed.), Cambridge University Press, ISBN 978-0-521-88439-6, MR 1723993