Elementary function arithmetic: Difference between revisions

Revision as of 21:23, 5 August 2016

Revision as of 13:36, 28 July 2017

Line 1:

In [[proof theory]], a branch of [[mathematical logic]], '''elementary function arithmetic''', also called '''EFA''', '''elementary arithmetic''' and '''exponential function arithmetic''', 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.