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: 3544
Download times: 1879
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2005.04.014
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.