From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!hellgate.utah.edu!asylum.utah.edu!tolman Tue May 12 15:48:59 EDT 1992
Article 5405 of comp.ai.philosophy:
Newsgroups: comp.ai.philosophy
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!hellgate.utah.edu!asylum.utah.edu!tolman
>From: tolman%asylum.utah.edu@cs.utah.edu (Kenneth Tolman)
Subject: Re: Goedel's theorem proof without self-referencing?
Date: 4 May 92 21:40:50 MDT
Message-ID: <1992May4.214051.16767@hellgate.utah.edu>
Organization: University of Utah CS Dept
References: <1992Apr23.183732.25378@kum.kaist.ac.kr>
Lines: 16

In article <1992Apr23.183732.25378@kum.kaist.ac.kr> jwlee@comsci.yonsei.ac.kr (Jaewoong Lee) writes:
>
>I have checked out some proofs on Godel's 1st incompleteness
>theorem done by Godel and Chaitin. Both of them used self-
>referencing statement (program) to prove the theorem.
>
>My questions are : 1) Is there any proof of Goedel's 1st incompleteness
>without using self-referencing technique? 

No, there are not.  Godel's theorem only works because it is self
referencing.  Basically, it is because a system can not rise above
itself.  Of course, I have no idea what I am saying, and you won't read
this anyway, so what does it matter?

However, it is a very interesting question.  



