Self-referential theories
From MaRDI portal
Abstract: We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.
Recommendations
Cites work
- A machine that knows its own code
- Absolute Versions of Incompleteness Theorems
- After Godel
- Elementary patterns of resemblance
- scientific article; zbMATH DE number 6833840 (Why is no real title available?)
- Intensional mathematics
- Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
- Ordinal arithmetic and \(\Sigma_1\)-elementarity
- Ungroundedness in Tarskian languages
Cited in
(7)- Fast-collapsing theories
- T-schema deflationism versus Gödel's first incompleteness theorem
- On the consistency of self-referential systems
- scientific article; zbMATH DE number 6424084 (Why is no real title available?)
- Strengthening Consistency Results in Modal Logic
- Specieslike clusters based on identical ancestor points
- Alethic reference
This page was built for publication: Self-referential theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858928)