Foundations of Computer Science

Nambiar, Kannan (2001) Foundations of Computer Science. [Preprint]

Full text available as:

[img] PDF


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


Repository Staff Only: item control page