Gödel’s Incompleteness Theorems Demystified: A Rigorous Formal–Metamathematical Exposition and Its Philosophical Limits
Annals of Communications in Mathematics · 30.06.2026
DOI: 10.62072/acm.2026.09032 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annals of Communications in Mathematics, online erschienen am 30.06.2026. Verfasst von Aliefya Mahalva Ayn. Die Arbeit nennt 6 Literaturangaben.
Abstract (Originalsprache)
This article assembles a detailed paper-level dependency chain for Gödel’s First and Second Incompleteness Theorems while identifying the effectiveness, consistency, and base-theory assumptions used at each stage. It separates computable enumerability from primitive-recursive axiomatizability; develops Gödel-style prime-power coding; fixes an explicit Hilbert calculus; gives capture-avoiding substitution with separate primitive-recursive majorants depending on all relevant variable indices; and proves primitive recursiveness of witness-annotated proof verification for a merely computably enumerable axiom set. The syntactic and classes are fixed effectively, making the induction axioms of primitive-recursively recognizable. The representability theorem is proved in by structural induction, using a finite-unfolding lemma, explicit closure under composition, and a displayed witness history for primitive recursion. For provability theory, the article defines a canonical trace-based proof predicate and gives detailed construction schemas, with explicit -induction invariants, for proof transformations and bounded proof synthesis in . These yield formalized -completeness, the Hilbert–Bernays–Löb derivability conditions, Löb’s theorem, and the Second Incompleteness Theorem. The article also proves Rosser’s strengthening, states Tarski’s theorem as the nondefinability of in arithmetic, and marks the limits of anti-mechanist interpretations. Its contribution is expository and organizational rather than a new incompleteness theorem.
Zitieren
APA
Ayn, A. M. (2026). Gödel’s Incompleteness Theorems Demystified: A Rigorous Formal–Metamathematical Exposition and Its Philosophical Limits. Annals of Communications in Mathematics. https://doi.org/10.62072/acm.2026.09032
Vancouver
Ayn AM. Gödel’s Incompleteness Theorems Demystified: A Rigorous Formal–Metamathematical Exposition and Its Philosophical Limits. Annals of Communications in Mathematics. 2026. doi:10.62072/acm.2026.09032
BibTeX
@article{Ayn2026,
author = {Ayn, Aliefya Mahalva},
title = {Gödel’s Incompleteness Theorems Demystified: A Rigorous Formal–Metamathematical Exposition and Its Philosophical Limits},
journal = {Annals of Communications in Mathematics},
year = {2026},
doi = {10.62072/acm.2026.09032}
}
EUVIMED