Books about Incompleteness from Amazon.com

"A gem….An unforgettable account of one of the great moments in the history of human thought "—Steven Pinker

A masterly introduction to the life and thought of the man who transformed our conception of math forever. Kurt Gödel is considered the greatest logician since Aristotle. His monumental theorem of incompleteness demonstrated that in every formal system of arithmetic there are true statements that nevertheless cannot be proved. The result was an upheaval that spread far beyond mathematics, challenging conceptions of the nature of the mind.

Rebecca Goldstein, a MacArthur-winning novelist and philosopher, explains the philosophical vision that inspired Gödel's mathematics, and reveals the ironic twist that led to radical misinterpretations of his theorems by the trendier intellectual fashions of the day, from positivism to postmodernism. Ironically, both he and his close friend Einstein felt themselves intellectual exiles, even as their work was cited as among the most important in twentieth-century thought. For Gödel , the sense of isolation would have tragic consequences.

This lucid and accessible study makes Gödel's theorem and its mindbending implications comprehensible to the general reader, while bringing this eccentric, tortured genius and his world to life.

About the series: Great Discoveries brings together renowned writers from diverse backgrounds to tell the stories of crucial scientific breakthroughs—the great discoveries that have gone on to transform our view of the world..
Price: $5.99 [Notify me when price goes down.]

.
Price: $46.59 [Notify me when price goes down.]

Russell's paradox arises when we consider those sets that do not belong to themselves The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski's result on the undefinability of truth. Variations on the same idea yield the famous results of Gödel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Gödel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski's Theorem to Gödel's Second Incompleteness Theorem. Exercises are scattered throughout..
Price: $26.99 [Notify me when price goes down.]

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 essential subject, the book will appeal to mathematicians, philosophers, and computer scientists..
Price: $72.38 [Notify me when price goes down.]

Dr Gregory Chaitin, one of the world s leading mathematicians, is best known for his discovery of the remarkable number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as Gödel and Turing. This book contains 23 non-technical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of program-size complexity or algorithmic information content in order to shed further light on the fundamental work of Gödel and Turing on the limits of mathematical methods, both in logic and in computation. Chaitin argues here that his information-theoretic approach to metamathematics suggests a quasi-empirical view of mathematics that emphasizes the similarities rather than the differences between mathematics and physics. He also develops his own brand of digital philosophy, which views the entire universe as a giant computation, and speculates that perhaps everything is discrete software, everything is 0's and 1's. Chaitin's fundamental mathematical work will be of interest to philosophers concerned with the limits of knowledge and to physicists interested in the nature of complexity..
Price: $47.04 [Notify me when price goes down.]

Aiming to unravel the mystery of quantum mechanics, this book is concerned with questions about action-at-a-distance, holism, and whether quantum mechanics gives a complete account of microphysical reality. With rigorous arguments and clear thinking, the author provides an introduction to the philosophy of physics..
Price: $33.08 [Notify me when price goes down.]

Gödels Incompleteness Theorems are among the most significant results in the foundation of mathematics. These results have a positive consequence: any system of axioms for mathematics that we recognize as correct can be properly extended by adding as a new axiom a formal statement expressing that the original system is consistent. This suggests that our mathematical knowledge is inexhaustible, an essentially philosophical topic to which this book is devoted.

Basic material in predicate logic, set theory and recursion theory is presented, leading to a proof of incompleteness theorems. The inexhaustibility of mathematical knowledge is treated based on the concept of transfinite progressions of theories as conceived by Turing and Feferman.

All concepts and results necessary to understand the arguments are introduced as needed, making the presentation self-contained and thorough..
Price: $38.00 [Notify me when price goes down.]

...revised 2nd edition contains new results and simplified proofs, as well as an up-to-date bibliography....
Price: $32.74 [Notify me when price goes down.]