Nambiar, Kannan (2001) Foundations of Computer Science. [Preprint]
Full text available as:
![[img]](http://cogprints.org/style/images/fileicons/application_pdf.png) | PDF 42Kb |
Abstract
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.
| Item Type: | Preprint |
|---|---|
| Keywords: | Generalized continuum hypothesis; Infinitesimal. |
| Subjects: | Philosophy > Logic |
| ID Code: | 1893 |
| Deposited By: | Nambiar, Kannan |
| Deposited On: | 18 Nov 2001 |
| Last Modified: | 11 Mar 2011 08:54 |
Metadata
- ASCII Citation
- BibTeX
- DIDL
- Dublin Core
- EP3 XML
- EPrints Application Profile (experimental)
- EndNote
- Eprints Application Profile
- HTML Citation
- ID Plus Text Citation
- JSON
- METS
- MODS
- OAI-ORE Resource Map (Atom Format)
- OAI-ORE Resource Map (RDF Format)
- OpenURL ContextObject
- OpenURL ContextObject in Span
- RDF+N-Triples
- RDF+N3
- RDF+XML
- Refer
- Reference Manager
- Search Data Dump
- Simple Metadata
- YAML
Repository Staff Only: item control page
