Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint
Vestrucci, Andrea (2026): Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint, in: Bamberg: Otto-Friedrich-Universität, S. 761–799.
Details
- Fakultät/Lehrstuhl
- Autorin(nen)/Autor(en)
- Verlagsangabe
- Otto-Friedrich-Universität : Bamberg
- Erscheinungsjahr
- 2026
- Quelle/Weitere Ausgabe
- Archive for mathematical logic, Berlin ; Heidelberg: Springer, 2026, Jg. 65, Nr. 6, S. 761–799, ISSN: 1432-0665, 0933-5846
- Jahr der Erstpublikation
- 2026
- Sprache(n)
- Englisch
- Lizenz
- URN
- Abstract
We present a type-disciplined, compositional reconstruction of the diagonal strategy in Gödel’s first incompleteness theorem. The goal is not a new or “more direct” proof of incompleteness, but an explicit computational unpacking of the mechanism. The paper exhibits a concrete pipeline of code-transformers between primitive recursive syntactic domains, thereby avoiding well-definedness issues arising in Lindenbaum-quotient formulations. A central feature is the separation between a graph-mediated witness form of the Gödel sentence and a canonical normal form, connected by an internal normalization lemma formalizable in the base theory. The paper also presents the construction categorically in a category of primitive recursive code domains and morphisms, and extracts a general diagonal-flipping blueprint clarifying how type stratification distinguishes paradoxical from limitative diagonal arguments.
- Freie Schlagwort(e)
- Gödel’s first incompleteness theoremDiagonalizationGödel numberingPrimitive recursive functionsLawvere fixed-point theoremDiagonal arguments
- Peer Reviewed
- ja
- Dokumenttyp
- Artikel in einer Zeitschrift / Postprint
- URI
- Datum der Freischaltung
- 05.10.2026
- Projekt(e)