Elementary function arithmetic

In proof theory, a branch of mathematical logic, elementary function arithmetic (EFA), also called elementary arithmetic and exponential function arithmetic, is the system of arithmetic with the usual elementary properties of 0, 1, +, ×, x^y , together with induction for formulas with bounded quantifiers. EFA is a very weak logical system, whose proof-theoretic ordinal is \omega^3 , but still seems able to prove much of ordinary mathematics that can be stated in the language of first-order arithmetic.

In proof theory, a branch of mathematical logic, elementary function arithmetic (EFA), also called elementary arithmetic and exponential function arithmetic, is the system of arithmetic with the usual elementary properties of 0, 1, +, ×,  x^y , together with induction for formulas with bounded quantifiers. EFA is a very weak logical system, whose proof-theoretic ordinal is \omega^3 , but still seems able to prove much of ordinary mathematics that can be stated in the language of first-order arithmetic. ==Definition== EFA is a system in first-order logic (with equality). Its language contains: two constants 0 , 1 , three binary operations + , \times , \textrm{exp} , with \textrm{exp}(x,y) usually written as x^y , 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 \forall(x and \exists(x which are abbreviations for \forall x(x and \exists x(x in the usual way. The axioms of EFA are The axioms of Robinson arithmetic for 0 , 1 , + , \times , The axioms for exponentiation: x^0=1 , x^{y+1}=x^y\times x . Induction for formulas all of whose quantifiers are bounded (but which may contain free variables). ==Related systems== Several related 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 called \mathsf{RCA}_0^* and \mathsf{WKL}_0^* that are conservative over EFA for \Pi_2^0 sentences (i.e. any \Pi_2^0 sentences proven by \mathsf{RCA}_0^* or \mathsf{WKL}_0^* are already proven by EFA.) In particular, they are conservative for consistency statements. These fragments are sometimes studied in reverse mathematics . Elementary recursive arithmetic (ERA) is a subsystem of primitive recursive arithmetic (PRA) in which recursion is restricted to bounded sums and products. This also has the same \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 manner, with just the rules of substitution 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== ==References==

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376798651 under CC BY-SA 4.0; modifications have been made.