{
 "uuid": "9542abf3-2117-4941-bd22-f392b5ddf0d2",
 "handle": "uniba/117549",
 "type": "Publication",
 "name": "Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint",
 "url": "/entities/publication/9542abf3-2117-4941-bd22-f392b5ddf0d2/",
 "lastModified": "2026-10-06T02:34:03.569+00:00",
 "metadata": {
  "cris.virtual.author-orcid": [
   {
    "value": "0000-0002-6336-1036"
   }
  ],
  "cris.virtualsource.author-orcid": [
   {
    "value": "70943bfc-61ae-4de5-b495-1f2098372eca"
   }
  ],
  "dc.contributor.author": [
   {
    "value": "Vestrucci, Andrea",
    "authority": "70943bfc-61ae-4de5-b495-1f2098372eca"
   }
  ],
  "dc.date.accessioned": [
   {
    "value": "2026-10-05T11:11:01Z"
   }
  ],
  "dc.date.available": [
   {
    "value": "2026-10-05T11:11:01Z"
   }
  ],
  "dc.date.issued": [
   {
    "value": "2026"
   }
  ],
  "dc.description.abstract": [
   {
    "value": "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."
   }
  ],
  "dc.identifier.doi": [
   {
    "value": "10.1007/s00153-026-01021-7"
   }
  ],
  "dc.identifier.issn": [
   {
    "value": "1432-0665"
   },
   {
    "value": "0933-5846"
   }
  ],
  "dc.identifier.uri": [
   {
    "value": "https://fis.uni-bamberg.de/handle/uniba/117549"
   }
  ],
  "dc.language.iso": [
   {
    "value": "eng"
   }
  ],
  "dc.publisher": [
   {
    "value": "Springer"
   }
  ],
  "dc.publisher.place": [
   {
    "value": "Berlin ; Heidelberg"
   }
  ],
  "dc.relation.authororgunit": [
   {
    "value": "Lehrstuhl für KI-Systementwicklung",
    "authority": "f098c435-7e9a-49f4-9faf-dd9518bd4372"
   }
  ],
  "dc.relation.issn": [
   {
    "value": "0933-5846"
   },
   {
    "value": "1432-0665"
   }
  ],
  "dc.relation.volume": [
   {
    "value": "65"
   }
  ],
  "dc.subject": [
   {
    "value": "Gödel’s first incompleteness theorem"
   },
   {
    "value": "Diagonalization"
   },
   {
    "value": "Gödel numbering"
   },
   {
    "value": "Primitive recursive functions"
   },
   {
    "value": "Lawvere fixed-point theorem"
   },
   {
    "value": "Diagonal arguments"
   }
  ],
  "dc.title": [
   {
    "value": "Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint"
   }
  ],
  "dc.type": [
   {
    "value": "article"
   }
  ],
  "dspace.entity.type": [
   {
    "value": "Publication"
   }
  ],
  "ubg.fulltexticon": [
   {
    "value": "true"
   }
  ],
  "ubg.generated.csl": [
   {
    "value": "<div class=\"csl-bib-body\">\n  <div class=\"csl-entry\">Vestrucci, Andrea (2026): Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint, in: <i>Archive for mathematical logic</i>, Berlin ; Heidelberg: Springer, Jg. 65, Nr. 6, S. 761–799, doi: 10.1007/s00153-026-01021-7.</div>\n</div>"
   }
  ],
  "ubg.generated.cslContainerTitle": [
   {
    "value": "Archive for mathematical logic"
   }
  ],
  "ubg.generated.cslDoi": [
   {
    "value": "10.1007/s00153-026-01021-7"
   }
  ],
  "ubg.intern.org": [
   {
    "value": "Lehrstuhl für KI-Systementwicklung",
    "authority": "f098c435-7e9a-49f4-9faf-dd9518bd4372"
   }
  ],
  "ubg.intern.vonfeld": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeldeditor": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.pages.range": [
   {
    "value": "761-799"
   }
  ],
  "ubg.peerreview": [
   {
    "value": "Ja"
   }
  ],
  "ubg.relation.issue": [
   {
    "value": "6"
   }
  ],
  "ubg.relation.project": [
   {
    "value": "Open-Access-Fonds",
    "authority": "e94f42a6-2eca-4354-af13-d2cdd760a9ff"
   }
  ],
  "ubg.submission.type": [
   {
    "value": "full-text"
   }
  ],
  "ubg.titleparent.journal": [
   {
    "value": "Archive for mathematical logic"
   }
  ],
  "ubg.version.hasversions": [
   {
    "value": "uniba/117550",
    "authority": "d684392b-4b01-409d-9e78-b0c64b279ed4"
   }
  ]
 },
 "relations": {},
 "files": []
}