Sign inSign in
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.
as Jim Harris defines itNational Capital Area Skeptics (NCAS)The wording closest to all 3 definitions
Watch it explained

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.

Formal logic2Arithmetic1Consistency1Formal mathematical systems1Formal systems1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Vladimir Voevodsky

    Institute for Advanced Study · Graduate

    A theorem in mathematical logic that states there are true statements in certain formal systems that cannot be proven within those systems.
    • 28:36Univalent Foundations: New Foundations of Mathematics
  • Gabriel Goldberg

    University of Oxford · Research

    A theorem stating that if you have some consistent theory, you cannot use that theory to prove its own consistency.
    • 5:00Even Ordinals and the Kunen Inconsistency

Lectures that assume it

1

Connections

7

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.