Elementary function arithmetic: Difference between revisions

Revision as of 05:19, 6 January 2020

Revision as of 08:18, 2 March 2020

Line 1:

{{No footnotes|date=November 2017}}

{{redirect|Elementary recursive arithmetic|the computational complexity class|ELEMENTARY}}

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 [[mathematical induction|induction]] for formulas with [[bounded quantifier]]s.