---
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.\n"
altloc:
  - http://www.rci.rutgers.edu/~kannan/foundations_computer_science.pdf
chapter: ~
commentary: ~
commref: ~
confdates: ~
conference: ~
confloc: ~
contact_email: ~
creators_id: []
creators_name:
  - family: Nambiar
    given: Kannan
    honourific: ''
    lineage: ''
date: 2001
date_type: published
datestamp: 2001-11-18
department: ~
dir: disk0/00/00/18/93
edit_lock_since: ~
edit_lock_until: ~
edit_lock_user: ~
editors_id: []
editors_name: []
eprint_status: archive
eprintid: 1893
fileinfo: /style/images/fileicons/application_pdf.png;/1893/3/foundations_computer_science.pdf
full_text_status: public
importid: ~
institution: ~
isbn: ~
ispublished: ~
issn: ~
item_issues_comment: []
item_issues_count: 0
item_issues_description: []
item_issues_id: []
item_issues_reported_by: []
item_issues_resolved_by: []
item_issues_status: []
item_issues_timestamp: []
item_issues_type: []
keywords: Generalized continuum hypothesis; Infinitesimal.
lastmod: 2011-03-11 08:54:49
latitude: ~
longitude: ~
metadata_visibility: show
note: ~
number: ~
pagerange: ~
pubdom: FALSE
publication: ~
publisher: ~
refereed: FALSE
referencetext: ~
relation_type: []
relation_uri: []
reportno: ~
rev_number: 12
series: ~
source: ~
status_changed: 2007-09-12 16:41:29
subjects:
  - phil-logic
succeeds: ~
suggestions: ~
sword_depositor: ~
sword_slug: ~
thesistype: ~
title: Foundations of Computer Science
type: preprint
userid: 2158
volume: ~
<script src="//archive-bar.soton.ac.uk/archive-bar.js"></script>