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. Introduction by R. B. Braithwaite.

In 1931, a young Austrian mathematician published an epoch-making paper containing one of the most revolutionary ideas in logic since Aristotle. Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, 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. The repercussions of this discovery are still being felt and debated in 20th-century mathematics. The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument. This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite.

In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of Albert Einstein, his theorem proved that mathematics was partly based on propositions not provable within the mathematical system and had radical implications that have echoed throughout many fields. A gripping combination of science and accessibility, Godel’s Proofby Nagel and Newman is for both mathematicians and the idly curious, offering those with a taste for logic and philosophy the chance to satisfy their intellectual curiosity.

"A valuable collection both for original source material as well as historical formulations of current problems." — The Review of Metaphysics "Much more than a mere collection of papers. A valuable addition to the literature." — Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field , this classic reference is ideally suited as a text for graduate and undergraduate courses in logic, philosophy, and foundations of mathematics. It is also appropriate for self-study. The text opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Supplementary items include corrections, emendations, and added commentaries by Godel, Church, and Kleene for this volume's original publication, along with a helpful commentary by the editor.

In 1931, the young Kurt Gödel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory of arithmetic, there are some arithmetical truths the theory cannot prove. This remarkable result is among the most intriguing (and most misunderstood) in logic. Gödel also outlined an equally significant Second Incompleteness Theorem. How are these Theorems established, and why do they matter? Peter Smith answers these questions by presenting an unusual variety of proofs for the First Theorem, showing how to prove the Second Theorem, and exploring a family of related results (including some not easily available elsewhere). The formal explanations are interwoven with discussions of the wider significance of the two Theorems. This book will be accessible to philosophy students with a limited formal background. It is equally suitable for mathematics students taking a first course in mathematical logic.

Kurt Gödel, together with Bertrand Russell, is the most important name in logic, and in the foundations and philosophy of mathematics of this century. However, unlike Russel, Gödel the mathematician published very little apart from his well-known writings in logic, metamathematics and set theory. Fortunately, Gödel the philosopher, who devoted more years of his life to philosophy than to technical investigation, wrote hundreds of pages on the philosophy of mathematics, as well as on other fields of philosophy. It was only possible to learn more about his philosophical works after the opening of his literary estate at Princeton a decade ago. The goal of this book is to make available to the scholarly public solid reconstructions and editions of two of the most important essays which Gödel wrote on the philosophy of mathematics. The book is divided into two parts. The first provides the reader with an incisive historico-philosophical introduction to Gödel's technical results and philosophical ideas. Written by the Editor, this introductory apparatus is not only devoted to the manuscripts themselves but also to the philosophical context in which they were written. The second contains two of Gödel's most important and fascinating unpublished essays: 1) the Gibbs Lecture ("Some basic theorems on the foundations of mathematics and their philosophical implications", 1951); and 2) two of the six versions of the essay which Gödel wrote for the Carnap volume of the Schilpp series The Library of Living Philosophers ("Is mathematics syntax of language?", 1953-1959).

David Hilbert was one of the great mathematicians who expounded the centrality of their subject in human thought. In this collection of essays, Wilfried Sieg frames Hilbert's foundational work, from 1890 to 1939, in a comprehensive way and integrates it with modern proof theoretic investigations.

This well-known book by the famed logician consists of three treatises: A General Method in Proofs of Undecidability, Undecidability and Essential Undecidability in Mathematics, and Undecidability of the Elementary Theory of Groups. 1953 edition.

A new theory of culture presented with a new method achieved by comparing closely the art and science in 20th century Austria and Hungary. Major achievements that have influenced the world like psychoanalysis, abstract art, quantum physics, Gestalt psychology, formal languages, vision theories, and the game theory etc. originated from these countries, and influence the world still today as a result of exile nurtured in the US. A source book with numerous photographs, images and diagrams, it opens up a nearly infinite horizon of knowledge that helps one to understand what is going on in today’s worlds of art and science.

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.