Foundations of computer science

A machine equivalent to Turing machine, that is more intuitive in its working is defined. Three derivation rules are added to Elementary Arithmetic of Godel and his incompleteness theorems are proved without using any metalanguage. Two axioms are added to Zermelo-Fraenkel theory to derive the Continuum Hypothesis and to split the unit interval into infinitesimals.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,707
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

8 ( #276,630 of 1,726,249 )

Recent downloads (6 months)

4 ( #183,615 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.