title: Foundations of Computer Science creator: Nambiar, Kannan subject: Logic description: 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 type: Preprint type: NonPeerReviewed format: application/pdf identifier: http://cogprints.org/1893/3/foundations_computer_science.pdf identifier: Nambiar, Kannan (2001) Foundations of Computer Science. [Preprint] relation: http://cogprints.org/1893/