Gödel incompleteness theorems

Layer 0 — Mathematicsin the logic subtree

1st: Any consistent recursively axiomatizable T containing PA is incomplete. 2nd: T cannot prove its own consistency. Diagonal lemma.

Related concepts

Explore Gödel incompleteness theorems on the interactive knowledge graph →