Abstract
In part I of this article [1], we described developments in mathematical logic before 1931. Gödel’s famous paper On formally undecidable propositions of Principia Mathematica and related systems, was published in January of that year. In it Gödel established two theorems:(1)Incompleteness: For any consistent theory at least as strong as arithmetic there are sentences which can neither be proved nor disproved in the theory.(2)Unprovability of consistency: The consistency of such a theory cannot be proved within the theory.We are going to outline, with minor adjustments to notation, Gödel’s actual proof of (1) given, in translation, in [2, pp. 5–38].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
