Linked from

The 58 pages that link to Gödel's incompleteness theorems, each with the reason it gives.

• Axiom (general principle)Related: They constrain what any suitable arithmetic axiom system can establish internally.

• CodeBroader topic: Gödel coding makes formal syntax available to arithmetic.

• Douglas HofstadterBroader topic: Hofstadter uses their self-referential structure as a model for discussions of minds.

• Löb's theoremRelated: Löb’s theorem uses related self-reference and provability methods but yields a distinct conditional conclusion.

• S-m-n theoremCompared with: Both use effective coding, but incompleteness concerns formal provability rather than program specialization.

• Axiom (mathematics and logic)Related: They constrain what any suitable arithmetic axiom system can prove about itself.

• Mathematical conceptsBroader topic: They establish limits on what formal mathematical systems can prove.

• Turing's proofRelated: Both results expose limits of formal methods, though they concern different notions of provability and computation.