Elementary function arithmetic: Difference between revisions

Revision as of 07:48, 8 November 2010

Revision as of 08:11, 5 February 2011

Line 1:

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, +, ×, ''x''^''y'', together with [[mathematical induction|induction]] for formulas with bounded quantifiers.

EFA is a very weak logical system, whose [[proof theoretic ordinal]] is ωω³, 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 +, ×, exp, with 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<y) and &exist;∃ (x<y) which are abbreviations for &forall;∀ x (x<y)&rarr;→,,, and &exist;x∃x (x<y)&and;∧... in the usual way.

The axioms of EFA are

Line 30:

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{{su|p=*|b=0}} and WKL{{su|p=*|b=0}} that have the same consistency strength as EFA and are conservative over it for &Pi;Π{{su|p=0|b=2}} sentences, which are sometimes studied in [[reverse mathematics]] {{harv|Simpson|2009}}.

Elementary recursive arithmetic (ERA) is a subsystem of [[primitive recursive arithmetic]] in which recursion is restricted to [[ELEMENTARY#Definition|bounded sums and products]]. This also has the same &Pi;Π{{su|p=0|b=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.

== See also ==

Line 46:

*{{Citation | last1=Simpson | first1=Stephen G. | title=Subsystems of second order arithmetic | url=http://www.math.psu.edu/simpson/sosoa/ | publisher=[[Cambridge University Press]] | edition=2nd | series=Perspectives in Logic | isbn=978-0-521-88439-6 | id={{MathSciNet | id = 1723993}} | year=2009}}

[[Category:proofProof theory]]

[[Category:proof theory]]

[[Category:Conjectures]]