Page loading

Gödel’s first incompleteness theorem

An interactive tutorial

Back in 1931, Kurt Gödel published his first mathematical mic-drop: “Our formal systems of logic can make statements that they can neither prove nor disprove.” In this chapter, you’ll learn what this famous theorem means, and you’ll learn a proof of it that builds upon Turing’s solution to the Halting Problem.

You’re previewing chapter 4 of Busy Beavers!. Get all 9 chapters forever for $9.

Quoted text:

Your feedback will be sent privately to the author. They may reply to you by email. Thanks for helping make this course better!