Revision as of 09:41, 17 August 2011 edit EdwardLane (talk \| contribs) Extended confirmed users 5,111 edits m →Definition: difficult to understand ← Previous edit		Revision as of 03:46, 17 September 2011 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,109 edits m Various citation cleanup and WP:AWB general fixes using AWB Next edit →
Line 4: ==Definition== {{incoherent\|date=September 2011}} EFA is a system in first order logic (with equality). Its language contains: Line 43: ==References== {{Citation \| last1=Avigad \| first1=Jeremy \| title=Number theory and elementary arithmetic \| doi=10.1093/philmat/11.3.257 \| idmr=~~{{MathSciNet \| id =~~ 2006194}} \| year=2003 \| journal=Philosophia Mathematica. Philosophy of Mathematics, its Learning, and its Application. Series III \| issn=0031-8019 \| volume=11 \| issue=3 \| pages=257–284}} {{citation \|first=Harvey \|last=Friedman \|title=grand conjectures \|year=1999 \|url=http://cs.nyu.edu/pipermail/fom/1999-April/003014.html}} *{{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 \| idmr=~~{{MathSciNet \| id =~~ 1723993}} \| year=2009}} [[Category:Proof theory]]

Elementary function arithmetic: Difference between revisions