On Formally Undecidable Propositions of Principia Mathema... and over one million other books are available for Amazon Kindle. Learn more

Vous voulez voir cette page en français ? Cliquez ici.


or
Sign in to turn on 1-Click ordering.
More Buying Choices
Have one to sell? Sell yours here
Start reading On Formally Undecidable Propositions of Principia Mathema... on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

On Formally Undecidable Propositions of Principia Mathematica and Related Systems [Paperback]

Kurt Godel
5.0 out of 5 stars  See all reviews (8 customer reviews)
List Price: CDN$ 9.25
Price: CDN$ 7.12 & eligible for FREE Super Saver Shipping on orders over CDN$ 25. Details
You Save: CDN$ 2.13 (23%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Usually ships within 10 to 13 days.
Ships from and sold by Amazon.ca. Gift-wrap available.

Formats

Amazon Price New from Used from
Kindle Edition CDN $5.65  
Paperback CDN $7.12  

Book Description

April 1 1992 0486669807 978-0486669809 New edition
First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. Introduction by R. B. Braithwaite.

Frequently Bought Together

Customers buy this book with Godel's Proof CDN$ 12.59

On Formally Undecidable Propositions of Principia Mathematica and Related Systems + Godel's Proof
Price For Both: CDN$ 19.71

One of these items ships sooner than the other. Show details

  • This item: On Formally Undecidable Propositions of Principia Mathematica and Related Systems

    Usually ships within 10 to 13 days.
    Ships from and sold by Amazon.ca.
    Eligible for FREE Super Saver Shipping on orders over CDN$ 25. Details

  • Godel's Proof

    In Stock.
    Ships from and sold by Amazon.ca.
    Eligible for FREE Super Saver Shipping on orders over CDN$ 25. Details


Customers Who Bought This Item Also Bought


Product Details


Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Excerpt | Back Cover
Search inside this book:

Customer Reviews

4 star
0
3 star
0
2 star
0
1 star
0
5.0 out of 5 stars
5.0 out of 5 stars
Most helpful customer reviews
5.0 out of 5 stars From the horse's mouth, 'le text' Aug 3 2003
Format:Paperback
Speaking not as a math specialist but one disposed to read a number of the popular explications of Godel's famous proof I can say that it was Godel's original text that did it for me. The reason is that it is the proof and not a lot of verbiage about the proof. And it is short and sweet. One problem is that the more common Turing Machine approach is actually 'easier', where Godel's approach is that of recursive functions which are more obscure, or at least less often discussed. If you can sort of glare at the recursive function issue and proceed with the basics of the proof it will stand out suddenly better than many of the popularizations. At least give it a try.
Was this review helpful to you?
5.0 out of 5 stars Read the masters! Oct 31 2001
Format:Paperback
THE proof as Goedel wrote it (plus typos). I have seen modern proofs of this theorem which are much easier to follow (as an example, a Mir book on mathematical logic by a Russian mathematician whose name I cannot recall), but this one is the REAL thing.

Modern proofs can be much clearer, but the original always has an added value. The writing style is not the best, but by reading this version you get a clearer idea of how Goedel came up with his theorem and the many difficulties he faced. Remember, by the time most of us read or heard about this for the first time, mathematical logic had advanced quite a few decades.

Was this review helpful to you?
Format:Paperback
Anyone who wants to trace this proof is free to do so. Though the formal logic can be formidable, and must be learned before tackling the proof, only the basic structure is necessary and it is not difficult to learn. It is also necessary to know a little about prime numbers, specifically that every composite number can be decomposed into some unique group of prime factors. Otherwise, all the technical aspects of the proof (barring the conclusion of theorem VI and a bit of the recursion) can be perfectly understood by someone outside of the world of formal mathmatics.

The proof itself is meant for a professional mathmatician. If you are interested and willing this will not dissuade you. To say Godel was not a master of exposition is misleading for he is ,if nothing else, just that. I have heard working through the proof compared to a mystical experience and the proof itself to a symphony. It is truly beautiful to even the mere math enthusiast. Godel is not, however, a college professor and does not wish to explain what need not be explained. This will not be of much consolation when he prefaces a statement with, "of course," for the twentieth time and you have no idea what he is talking about. But if you are not afraid to go ahead when you have tried and failed to understand, and are not afraid to return when you have gained some small piece of the puzzle and try again, everything will come clear. This is the original. All the commentaries are great, and some are even helpful before you get to the conclusion, but they are not the proof and should not be taken as a substitute. They do not suffice the way a generic drug does. There is no way to understand the full scope of the proof if you are not willing to immerse yourself in it and the language it uses. Everything in it is self-referential, you miss the reference when you skip the proof.

Don't worry if it seems to be going nowhere, because you'll get there soon enough yourself and it turns out everything matters(although nothing has meaning). If you want you can skip everything after theorem VI is proved up to the beginning of theorem XI. Then you will have everything you read about.

Perhaps, if you can, you should get a couple other people to work through it with; different perspectives make all the difference, even in math. It's nice to have someone to share your frustration with and sometimes to have it relieved. Plus the delight of watching the theorem build like a wave and crash down upon itself is best shared with others.

Last, and particularly directed toward anyone at DOVER: The proof as you have printed it is horribly mangled! There are countless misprints (more than fifty). This is bad enough in prose but absolutely disgusting in a math text. The second to last line of theorem VI (the proof of undecidability) has a misprint to the effect of changing a negative statement into a positive one. The proof is hard enough as it is. There is a much better translation (without any misprints) in "Frege and Godel" and "From Frege to Godel," which are sadly out of print but may be found at a library. The DOVER is cheap and it reads that way.

If you're interested, do it, and don't worry about it being too hard. You will realize the technical aspects are almost all quite easy when you plow through them. So wade in and enjoy!

Was this review helpful to you?
Want to see more reviews on this item?

Listmania!

Create a Listmania! list

Look for similar items by category


Feedback


Amazon.ca Privacy Statement Amazon.ca Shipping Information Amazon.ca Returns & Exchanges