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
- Faculty/Chair
- Faculty/Professorship
- Author
- Publisher Information
- Otto-Friedrich-Universität : Bamberg
- Year of publication
- 2026
- Source/Other editions
- Archive for mathematical logic, Berlin ; Heidelberg: Springer, 2026, Jg. 65, Nr. 6, S. 761–799, ISSN: 1432-0665, 0933-5846
- Year of first publication
- 2026
- Language
- English
- Licence
- 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.
- Keywords
- Gödel’s first incompleteness theoremDiagonalizationGödel numberingPrimitive recursive functionsLawvere fixed-point theoremDiagonal arguments
- Peer Reviewed
- yes
- Type
- Article
- URI
- Activation date
- 2026-10-05
- Project(s)