From newshub.ccs.yorku.ca!torn!cs.utexas.edu!uunet!sdrc!dodins Mon Nov  9 09:36:44 EST 1992
Article 7510 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!torn!cs.utexas.edu!uunet!sdrc!dodins
>From: dodins@sdrc.sdrc.com (John Dinsmore)
Newsgroups: comp.ai.philosophy
Subject: Re: The Paradox of the Unexpected Hanging
Summary: prisoner + judge = simple Godelian sentence
Message-ID: <2217@sdrc.COM>
Date: 4 Nov 92 18:29:16 GMT
References: <1992Nov3.051001.21374@oracorp.com>
Sender: news@sdrc.COM
Lines: 10


All of this discussion is very nice, but provides no insight into an already elegant proof:

Kurt Godel has already resolved this issue (circa 1930) with his mathematical proof that
any formal system--read logic--is incomplete in the sense that, given any consistent set 
of axioms, there are true statements in the resulting system that cannot be derived
from these axioms.

Read the original. You'll like it.



