On Mar 2, 2008, at 3:47 PM, Chris Menzel wrote:
> It is immediate from this fact thatGoedel's result applies to any
> *first-order* system that contains the bit of number theory (now
> often called Robinson Arithmetic) needed to code its proof theory --
> basically, this means just a couple of axioms for 0 and the
> successor function ("0 is no number's successor"; "numbers with the
> same successor are identical") (01)
Forgot one: "every number other than 0 is the successor of some number". (02)
> and the usual axioms for arithmetic and multiplication ("x+0=x", "x
> +fy = f(x+y)", "x*0=0", "x*fy = x*(x*y)"). (03)
arithmetic ==> addition (04)
-chris (05)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Subscribe/Config: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (06)
|