ConceptAI & ML
Gödel's first incompleteness theorem
In any reasonable formal system of mathematical provability, there are some true statements that are not provable.
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
2Each in their own terms, from the easiest level.
Jim Harris
Consistent arithmetic systems contain true statements that are unprovable or disprovable within them.
Connections
5The lectures that define it or assume it, and the concepts next to it.