On Formally Undecidable Propositions Of Principia Mathematica And Related Systems

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.

The first book to present a readable explanation of Godel's theorem to both scholars and non-specialists, this is a gripping combination of science and accessibility, 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 Kurt Gödel published his paper, "On Formally Undecidable Propositions of Principia Mathematica and Related Systems." Gödel’s paper challenged certain basic assumptions underlying much research in mathematics and logic. However, few scholars were unable to understand Gödel’s ideas. Ernest Nagel and James Newman provide a readable and accessible explanation of the main ideas and broad implications of Gödel's discovery.

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.

Peter Smith examines Gödel's Theorems, how they were established and why they matter.

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.

"An introduction to the life and thought of Kurt Gödel, who transformed our conception of math forever"--Provided by publisher.