On Formally Undecidable Propositions of Principia Mathematica and Related Systems Essential to the education of
On Formally Undecidable Propositions of Principia Mathematica and Related Systems Essential to the education ofIn 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
Pay in 4 interest-free payments of $2.99 Learn more
Shipping Estimate
USA
- USA
- CAN
- USA
- CAN
Ships within 48 hours · Estimated delivery Jul 31 - Aug 5