creators_name: Nambiar, Kannan
type: preprint
datestamp: 2001-11-18
lastmod: 2011-03-11 08:54:49
metadata_visibility: show
title: Foundations of Computer Science
subjects: phil-logic
full_text_status: public
keywords: Generalized continuum hypothesis; Infinitesimal.
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.

date: 2001
date_type: published
refereed: FALSE
citation:   Nambiar, Kannan  (2001) Foundations of Computer Science.  [Preprint]     
document_url: http://cogprints.org/1893/3/foundations_computer_science.pdf