Read On Formally Undecidable Propositions of Principia Mathematica and Related Systems by Kurt Gödel Free Online
Book Title: On Formally Undecidable Propositions of Principia Mathematica and Related Systems|
The size of the: 15.93 MB
Edition: Dover Publications
Date of issue: April 1st 1992
ISBN 13: 9780486669809
The author of the book: Kurt Gödel
Format files: PDF
Read full description of the books: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.
Read information about the authorKurt Gödel was an Austrian-American logician, mathematician and philosopher. One of the most significant logicians of all time, Gödel made an immense impact upon scientific and philosophical thinking in the 20th century, a time when many, such as Bertrand Russell, A. N. Whitehead and David Hilbert, were pioneering the use of logic and set theory to understand the foundations of mathematics.
Gödel is best known for his two incompleteness theorems, published in 1931 when he was 25 years of age, one year after finishing his doctorate at the University of Vienna. The more famous incompleteness theorem states that for any self-consistent recursive axiomatic system powerful enough to describe the arithmetic of the natural numbers (Peano arithmetic), there are true propositions about the naturals that cannot be proved from the axioms. To prove this theorem, Gödel developed a technique now known as Gödel numbering, which codes formal expressions as natural numbers.
He also showed that the continuum hypothesis cannot be disproved from the accepted axioms of set theory, if those axioms are consistent. He made important contributions to proof theory by clarifying the connections between classical logic, intuitionistic logic, and modal logic.
Add a comment
Read EBOOK On Formally Undecidable Propositions of Principia Mathematica and Related Systems by Kurt Gödel Online free