Revision as of 17:02, 20 October 2010 edit R.e.b. (talk \| contribs) Extended confirmed users, Pending changes reviewers 42,907 edits m oops ← Previous edit		Revision as of 17:05, 20 October 2010 edit undo R.e.b. (talk \| contribs) Extended confirmed users, Pending changes reviewers 42,907 edits tidy Next edit →
Line 1: In [[proof theory]], a branch of [[mathematical logic]], '''elementary function ~~arithymetic~~arithmetic''' or '''EFA''' is the ~~weak fragment~~system of ~~[[Peano Arithmetic]]~~arithmetic with the usual elementary properties of 0, 1, +, ×, ''x''<sup>''y''</sup>, together with ~~the scheme of~~ [[mathematical induction\|induction]] for formulas with bounded quantifiers. ==Friedman's grand conjecture==

Elementary function arithmetic: Difference between revisions