This is a qiestion about self-referencing and incompletness in formal theories
mathoverflow.net
Gödel's Incompleteness Theorems showed that self-reference inside formal systems like Principia Mathematica isn't just a curiosity — it's the hidden crack that shatters the dream of complete, consistent mathematics.
Gödel's Incompleteness TheoremsSelf-ReferenceFormal Systems TheoryRussell's Theory of Types
Theory Briefing
- A MathOverflow question asks whether self-referencing can appear in valid formulae of formal theories similar to Principia Mathematica.
- Gödel's Incompleteness Theorems hinge on exactly this — self-referential statements like 'this formula is unprovable' expose limits in any sufficiently powerful formal system.
- The question probes whether incompleteness is a structural inevitability or an avoidable quirk, a debate foundational to all of modern logic.