[FOM] Simple historical question

Richard Heck rgheck at brown.edu
Tue Jul 24 00:51:42 EDT 2007

H. Enderton wrote:
> As for your pedagogical point, I quite agree.  Now that we have a robust
> theory of computability, I think we can say that the heart of Goedel's
> first incompleteness theorem lies in the fact that true arithmetic is
> not computably enumerable.  Of course, in 1931 the computability concepts
> were unavailable.
I've always liked the way Boolos and Jeffrey do this. The core theorem 
is: No consistent extension of Q is decidable. All the other classical 
results then follow.


Richard G Heck, Jr
Professor of Philosophy
Brown University
Get my public key from http://sks.keyserver.penguin.de
Hash: 0x1DE91F1E66FFBDEC
Learn how to sign your email using Thunderbird and GnuPG at:

More information about the FOM mailing list