Page loading
Skip to main content

Gödel’s first incompleteness theorem [WIP!]

Back in 1936, when mathematicians were feeling pretty proud of their modern rigorous math. Then Kurt Gödel came along with this bombshell: “Our systems of logic can make statements that they can neither prove nor disprove.” This was just the first of Godel’s “mike drop” theorems.

Gödel’s first theorem was more precise than this, and his proof was tortuous. In this lesson, you’ll learn exactly what the theorem means, and you’ll learn a much simpler proof of it, building on the previous lesson on the Halting Problem.

Error: PromptContext provided undefined contextContinue