Abstract
In 1931, the great Austrian mathematician Kurt Godel proved “all consistent axiomatic formulations of number theory include undecidable propositions”. This discovery of Godel and its proof had enormous repercussions in mathematics and computer science. The proof hinged upon the writing of a self-referential mathematical statement, in the same way as the liar’s paradox — I am lying — is a self-referential statement. In this three-part article, we describe Godel’s discovery and his famous proof.
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.
