On Formally Undecidable Propositions of Principia Mathematica and Related Systems
Sign in to keep track of books you’ve read and want to read.
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.
Read more
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.
Liked On Formally Undecidable Propositions of Principia Mathematica and Related Systems? Here’s where I’d start.
These suit anyone who liked On Formally Undecidable Propositions of Principia Mathematica and Related Systems. Sign in and mark a few books for picks shaped around your own taste.
-
Proofs and Refutations: The Logic of Mathematical Discovery Shares mathematics, philosophy, science -
Principia Mathematica to '56 Shares mathematics, philosophy, math -
Incompleteness: The Proof and Paradox of Kurt Gödel Shares mathematics, philosophy, math -
Indiscrete Thoughts Shares mathematics, philosophy, math
