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.


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

More about this material


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