Skip to content

Godel's Incompleteness Theorems

Best in textbook rentals since 2012!

ISBN-10: 0195046722

ISBN-13: 9780195046724

Edition: 1992

Authors: Raymond M. Smullyan

List price: $360.00
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!

Rental notice: supplementary materials (access codes, CDs, etc.) are not guaranteed with rental orders.

what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable". His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame.In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but…    
Customers also bought

Book details

List price: $360.00
Copyright year: 1992
Publisher: Oxford University Press, Incorporated
Publication date: 8/20/1992
Binding: Hardcover
Pages: 160
Size: 9.57" wide x 6.38" long x 0.70" tall
Weight: 1.122
Language: English

Raymond Smullyan, a retired distinguished professor of philosophy, has authored over twenty books. He has had a remarkably diverse sequence of careers-as a pianist, magician, mathematical logician, philosopher, and essayist. His widely known writings are on such varied topics as mathematical logic, retrograde chess analysis, stereo photography, Chinese philosophy, psychology, and religion. He currently resides with his musician wife Blanche in the Catskill Mountains of upper New York State.

The General Idea Behind Gdel's Proof
Tarski's Theorem for Arithmetic
The Incompleteness of Peano Arithmetic with Exponentation
Arithmetic Without the Exponential
Gdel's Proof Based on Consistency
Rosser Systems
Shepherdson's Representation Theorems
Definability and Diagonalization
The Unprovability of Consistency
Some General Remarks on Provability and Truth
Self-Referential Systems