From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!sun-barr!ames!news.hawaii.edu!kum.kaist.ac.kr!usenet Thu Apr 30 15:22:21 EDT 1992
Article 5223 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!sun-barr!ames!news.hawaii.edu!kum.kaist.ac.kr!usenet
>From: jwlee@comsci.yonsei.ac.kr (Jaewoong Lee)
Subject: Goedel's theorem proof without self-referencing?
Message-ID: <1992Apr23.183732.25378@kum.kaist.ac.kr>
Organization: CS Dept., Yonsei University, Seoul
Date: Thu, 23 Apr 92 18:37:32 GMT
Lines: 24


I have checked out some proofs on Goedel's 1st incompleteness
theorem done by Goedel 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? 
2) if not, why? Is it because of innate nature of  Goedel's 1st 
incompleteness theorem? Or is it just because non-self-referencing
version is not found yet? (All recursive statements are subset of
non-recursive statements and all recursive function can be described
non-recursively.. right? If so what is the non-recursive version of
Goedel sentence?)

I have some trouble in news reading. So if you can, please mail it
directly. Thank you.

jwlee@comsci.yonsei.ac.kr

--
Jaewoong Lee, AI Lab, Computer Science Dept., Yonsei University,
              Seoul, 120-749, Korea
Phone ) +82-2-361-2713 (lab) +82-2-401-4569 (home)
E-mail) jwlee@comsci.yonsei.ac.kr (Internet) JWLEE@KRYSUCC1 (BITNET)


