?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=Foundations+of+Computer+Science&rft.creator=Nambiar%2C+Kannan&rft.subject=Logic&rft.description=A+machine+equivalent+to+Turing+machine%2C+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.%0A&rft.date=2001&rft.type=Preprint&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.identifier=http%3A%2F%2Fcogprints.org%2F1893%2F3%2Ffoundations_computer_science.pdf&rft.identifier=++Nambiar%2C+Kannan++(2001)+Foundations+of+Computer+Science.++%5BPreprint%5D+++++&rft.relation=http%3A%2F%2Fcogprints.org%2F1893%2F