Article thumbnail
Location of Repository

Foundations of Computer Science

By Kannan Nambiar

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

Topics: Logic
Year: 2001
OAI identifier: oai:cogprints.org:1893

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.