ConceptMathematics
Gödel's incompleteness theorem
Formal theorems stating that any consistent formal system capable of elementary arithmetic contains statements that cannot be proven or disproven within the system.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Vladimir Voevodsky
A theorem in mathematical logic that states there are true statements in certain formal systems that cannot be proven within those systems.Gabriel Goldberg
A theorem stating that if you have some consistent theory, you cannot use that theory to prove its own consistency.
Lectures that assume it
1Connections
7The lectures that define it or assume it, and the concepts next to it.