[FOM] Simple historical question
rgheck at brown.edu
Tue Jul 24 00:53:21 EDT 2007
Roger Bishop Jones wrote:
> However, a vigorous defence was mounted.
> If A is moderated to "arithmetic truth is not arithmetically definable",
> then the argument is sound, and can be generalised to give stronger
> negative results than that arithmetic truth is not recursively enumerable.
I heard Quine lecture on this very point at BU in, oh, it must have been
1994 or so. His point was precisely that Tarski's theorem, stated in
that form, is stronger than G"odel's.
Richard G Heck, Jr
Professor of Philosophy
Get my public key from http://sks.keyserver.penguin.de
Learn how to sign your email using Thunderbird and GnuPG at:
More information about the FOM