MERLOT - Multimedia Education Resource for Learning and Online Teaching
Home Communities Learning Materials Member Directory My Profile About Us

Material Detail

Become a Member | Log In

Foundations of Computer Science

Bookmark and Share
 
Location: Go to Material
Material Type: Tutorial
Technical Format: PDF
Date Added to MERLOT: June 13, 2001
Date Modified in MERLOT: May 23, 2008
  [Report Broken Link For This Material]

Author:
Submitter : Kannan Nambiar

Description:
NuMachine, as powerful as Turing machine, but more intuitive in its working is described. Adding three more derivation rules to Elementary Arithmetic of Godel and calling it Sentient Arithmetic (SA), the incompleteness theorems are proved within SA, without using any metalanguage. Intuitive Set Theory (IST), a theory in which we do not have to deal with cardinals higher than aleph-null, is described. In IST, there is no Skolem Paradox and there are no nonLebesgue measurable sets.

Browse in Categories:

More information about this material:
Primary Audience: College General Ed, Graduate School, Professional
Mobile Compatibility: Not specified at this time
Technical Requirements: AcrobatReader4

Language: English
Cost Involved: no
Source Code Available: no
Accessiblity Information Available: no
Copyright: yes
Creative Commons: unsure

About this material:

Peer Reviews (not reviewed)
Workflow status (under review)
Comments (1)avg: 4
                                            
                                            stars
Learning Exercises (none)
Personal Collections (1)
Accessibility Info (none)
 

Add your own:

Write a comment
Create a learning exercise
Add accessibility information


 
Report this as an Inappropriate Material
QR Code for this Page
 
 
--%>