1. Home
  2. Material Detail: Sentient Arithmetic and Godel's Theorems

Material Detail

Sentient Arithmetic and Godel's Theorems

Sentient Arithmetic and Godel's Theorems

Godel has proved that there are formulas in Elementary Arithmetic, which will introduce contradictions, irrespective of whether we assume the formula itself or its negation. His proof is in metalanguage. Sentient Arithmetic (SA) adds three more derivation rules to EA and shows that the proof for incompleteness of SA can be given in SA itself without using any metalanguage.... Show More
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Quiz/Test
Date Added to MERLOT:
June 25, 2001
Date Modified in MERLOT:
April 2, 2015
Author:
 
Submitter:
Kannan Nambiar
Primary Audience:
College General Ed, Graduate School, Professional
Technical Format:
PDF
Mobile Compatibility:
Not specified at this time
Technical Requirements:
AcrobatReader4
Language:
English
Cost Involved:
No
Source Code Available:
No
Creative Commons:
No

Browse...

Disciplines with similar materials as Sentient Arithmetic and Godel's Theorems
People who viewed this also viewed
Other materials like Sentient Arithmetic and Godel's Theorems

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.