# Elementary function arithmetic

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Elementary_function_arithmetic
> Markdown URL: https://mediated.wiki/source/Elementary_function_arithmetic.md
> Source: https://en.wikipedia.org/wiki/Elementary_function_arithmetic
> Source revision: 1316641180
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

System of arithmetic in proof theory

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (November 2017) (Learn how and when to remove this message)

"Elementary recursive arithmetic" redirects here. For the computational complexity class, see [Elementary recursive function](/source/Elementary_recursive_function).

In [proof theory](/source/Proof_theory), a branch of [mathematical logic](/source/Mathematical_logic), **elementary function arithmetic** (**EFA**), also called **elementary arithmetic** and **exponential function arithmetic**,[1] is the system of arithmetic with the usual elementary properties of 0, 1, +, ×, x y {\displaystyle x^{y}} , together with [induction](/source/Mathematical_induction) for formulas with [bounded quantifiers](/source/Bounded_quantifier).

EFA is a very weak logical system, whose [proof-theoretic ordinal](/source/Proof-theoretic_ordinal) is ω 3 {\displaystyle \omega ^{3}} , but still seems able to prove much of ordinary mathematics that can be stated in the language of [first-order arithmetic](/source/Peano_axioms).

## Definition

EFA is a system in first-order logic (with equality). Its language contains:

- two constants 0 {\displaystyle 0} , 1 {\displaystyle 1} ,

- three binary operations + {\displaystyle +} , × {\displaystyle \times } , exp {\displaystyle {\textrm {exp}}} , with exp ( x , y ) {\displaystyle {\textrm {exp}}(x,y)} usually written as x y {\displaystyle x^{y}} ,

- a binary relation symbol < {\displaystyle <} (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 ) {\displaystyle \forall (x<y)} and ∃ ( x < y ) {\displaystyle \exists (x<y)} which are abbreviations for ∀ x ( x < y ) → … {\displaystyle \forall x(x<y)\rightarrow \ldots } and ∃ x ( x < y ) ∧ … {\displaystyle \exists x(x<y)\land \ldots } in the usual way.

The axioms of EFA are

- The axioms of [Robinson arithmetic](/source/Robinson_arithmetic) for 0 {\displaystyle 0} , 1 {\displaystyle 1} , + {\displaystyle +} , × {\displaystyle \times } , < {\displaystyle <}

- The axioms for exponentiation: x 0 = 1 {\displaystyle x^{0}=1} , x y + 1 = x y × x {\displaystyle x^{y+1}=x^{y}\times x} .

- Induction for formulas all of whose quantifiers are bounded (but which may contain [free variables](/source/Free_variable)).

## Friedman's grand conjecture

[Harvey Friedman](/source/Harvey_Friedman_(mathematician))'s **grand conjecture** implies that many mathematical theorems, such as [Fermat's Last Theorem](/source/Fermat's_Last_Theorem), can be proved in very weak systems such as EFA.

The original statement of the conjecture from [Friedman (1999)](#CITEREFFriedman1999) is:

- "Every theorem published in the *[Annals of Mathematics](/source/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](/source/Peano_Arithmetic) based on the usual quantifier-free axioms for 0, 1, +, ×, exp, together with the scheme of [induction](/source/Mathematical_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](/source/Consistency) statements from logic, several statements related to [Ramsey theory](/source/Ramsey_theory) such as the [Szemerédi regularity lemma](/source/Szemer%C3%A9di_regularity_lemma), and the [graph minor theorem](/source/Graph_minor_theorem).

## Related systems

Several related [computational complexity classes](/source/Computational_complexity_classes) have similar properties to EFA:

- 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](/source/Second-order_arithmetic) called R C A 0 ∗ {\displaystyle {\mathsf {RCA}}_{0}^{*}} and W K L 0 ∗ {\displaystyle {\mathsf {WKL}}_{0}^{*}} that are conservative over EFA for Π 2 0 {\displaystyle \Pi _{2}^{0}} sentences (i.e. any Π 2 0 {\displaystyle \Pi _{2}^{0}} sentences proven by R C A 0 ∗ {\displaystyle {\mathsf {RCA}}_{0}^{*}} or W K L 0 ∗ {\displaystyle {\mathsf {WKL}}_{0}^{*}} are already proven by EFA.)[2] In particular, they are conservative for consistency statements. These fragments are sometimes studied in [reverse mathematics](/source/Reverse_mathematics) ([Simpson 2009](#CITEREFSimpson2009)).

- **Elementary recursive arithmetic** (**ERA**) is a subsystem of [primitive recursive arithmetic](/source/Primitive_recursive_arithmetic) (PRA) in which recursion is restricted to [bounded sums and products](/source/ELEMENTARY#Definition). This also has the same Π 2 0 {\displaystyle \Pi _{2}^{0}} 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. Like PRA, ERA can be defined in an entirely logic-free[*[clarification needed](https://en.wikipedia.org/wiki/Wikipedia:Please_clarify)*] manner, with just the rules of [substitution](/source/Substitution_(logic)) and induction, and defining equations for all elementary recursive functions. Unlike PRA, however, the elementary recursive functions can be characterized by the closure under composition and projection of a *finite* number of basis functions, and thus only a finite number of defining equations are needed.

## See also

- [Elementary function](/source/Elementary_function) – Type of mathematical function

- [Grzegorczyk hierarchy](/source/Grzegorczyk_hierarchy) – Functions in computability theory

- [Reverse mathematics](/source/Reverse_mathematics) – Branch of mathematical logic

- [Ordinal analysis](/source/Ordinal_analysis) – Mathematical technique used in proof theory

- [Tarski's high school algebra problem](/source/Tarski's_high_school_algebra_problem) – Mathematical problem

## References

1. **[^](#cite_ref-1)** C. Smoryński, "Nonstandard Models and Related Developments" (p. 217). From *Harvey Friedman's Research on the Foundations of Mathematics* (1985), Studies in Logic and the Foundations of Mathematics vol. 117.

1. **[^](#cite_ref-2)** S. G. Simpson, R. L. Smith, "[Factorization of polynomials and Σ 1 0 {\displaystyle \Sigma _{1}^{0}} -induction](https://www.sciencedirect.com/science/article/pii/0168007286900746)" (1986). [Annals of Pure and Applied Logic](/source/Annals_of_Pure_and_Applied_Logic), vol. 31 (p.305)

- [Avigad, Jeremy](/source/Jeremy_Avigad) (2003), "Number theory and elementary arithmetic", *[Philosophia Mathematica](/source/Philosophia_Mathematica)*, Series III, **11** (3): 257–284, [doi](/source/Doi_(identifier)):[10.1093/philmat/11.3.257](https://doi.org/10.1093%2Fphilmat%2F11.3.257), [ISSN](/source/ISSN_(identifier)) [0031-8019](https://search.worldcat.org/issn/0031-8019), [MR](/source/MR_(identifier)) [2006194](https://mathscinet.ams.org/mathscinet-getitem?mr=2006194)

- Friedman, Harvey (1999), [*grand conjectures*](http://cs.nyu.edu/pipermail/fom/1999-April/003014.html)

- [Simpson, Stephen G.](/source/Steve_Simpson_(mathematician)) (2009), [*Subsystems of second order arithmetic*](http://www.math.psu.edu/simpson/sosoa/), Perspectives in Logic (2nd ed.), [Cambridge University Press](/source/Cambridge_University_Press), [ISBN](/source/ISBN_(identifier)) [978-0-521-88439-6](https://en.wikipedia.org/wiki/Special:BookSources/978-0-521-88439-6), [MR](/source/MR_(identifier)) [1723993](https://mathscinet.ams.org/mathscinet-getitem?mr=1723993)

v t e Mathematical logic General Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory Theorems (list), paradoxes Gödel's completeness – incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem – paradox – diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox Logics Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus Set theory Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps, cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive Formal systems (list), language, syntax Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of true arithmetic Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry Euclidean Elements Hilbert's Tarski's non-Euclidean Principia Mathematica Proof theory Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories Model theory Interpretation function of models Model atomic equivalence finite prime saturated spectrum submodel Non-standard model of non-standard arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity Computability theory Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask Mathematics portal

---
Adapted from the Wikipedia article [Elementary function arithmetic](https://en.wikipedia.org/wiki/Elementary_function_arithmetic) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Elementary_function_arithmetic?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.