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:20 EDT 1992
Article 5222 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: Self-referencing in Goedel's proof
Message-ID: <1992Apr23.180600.25237@kum.kaist.ac.kr>
Summary: Asking a proof using non-self-referencing for Goedel 1st
Keywords:  Goedel Self-referencing 
Organization: CS Dept., Yonsei University, Seoul
Date: Thu, 23 Apr 92 18:06:00 GMT
Lines: 44

I have something to ask about the Goedel's 1st incompleteness theorem.

I have checked out the proofs of Goedel's 1st incompletenetss theorem

made by Goedel,  Chaitin, and some others. They all used self-referencing

statements (or programs) to prove the theorem.

 

My question are these :

 

Is there any version of proof not using self-referencing ?

If there is none, why do we have to use self-referencing technique to

prove the Goedel's incompleteness theorem? Is it because the innate

property of Goedel's theorem or is it just because non-self-referencing

version is not found?

 

It is not easy for me to read news. So please mail me directly, if possible.

 

Thank you.

 

 




--
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)


