A Set-Theoretical Lemma That Implies an Abstract Form of G?del's Theorem
Received:March 14, 2005  
Key Words: Enumerably infinite set   Godel's Incompleteness Theorem   turing machines.  
Fund Project:
Author NameAffiliation
Edward Arroyo Department of Computer Science
Francis Marion University
Florence
SC
USA 
L. C. Hsu Department of Mathematics
Dalian University of Technology
Liaoning
China 
Hits: 3059
Download times: 1569
Abstract:
      We propose a simple set-theoretical lemma that implies G?del's Incompleteness Theorem. Also mentioned are some related consequences.
Citation:
DOI:10.3770/j.issn:1000-341X.2005.04.014
View Full Text  View/Add Comment