Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint

Publication

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: Archive for mathematical logic, Berlin ; Heidelberg: Springer, Jg. 65, Nr. 6, S. 761–799, doi: 10.1007/s00153-026-01021-7.

Details

Faculty/Chair
Faculty/Professorship
Author
Title of the Journal
Archive for mathematical logic
ISSN
1432-0665
0933-5846
Publisher Information
Springer : Berlin ; Heidelberg
Year of publication
2026
Volume
65
Issue
6
Language
English
DOI
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 theorem
Diagonalization
Gödel numbering
Primitive recursive functions
Lawvere fixed-point theorem
Diagonal arguments
Peer Reviewed
yes
Type
Article
URI
Activation date
2026-10-05
Project(s)

Permalink: https://fis.uni-bamberg.de/handle/uniba/117549 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.