Content deleted Content added
→Friedman's grand conjecture: - seek example for claim "it is easy to construct …" |
→top: - request inline references using "No footnotes" template |
||
Line 1:
{{No footnotes|date=November 2017}}
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''<sup>''y''</sup>, together with [[mathematical induction|induction]] for formulas with [[bounded quantifiers]].
| |||