Gödel's Incompleteness Theorems and the Necessity of Semantics for Arithmetic

Read full text Summarise with VIRAT
Authors: Miltiadis Karazoupis
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This work traces a philosophical and mathematical thread from ancient Greek mathematics to modern foundational logic. The Greeks maintained a sharp distinction between ἀριθμητική (arithmetic as the theoretical science of numbers) and λογιστική (calculation as a practical art), while also separating arithmetic from formal logic. This separation, grounded in ontological and epistemological considerations, allowed Greek mathematics to avoid the foundational crises that would emerge two millennia later. The development of formal logic in the late nineteenth and early twentieth centuries—particularly through the work of Frege, Russell, and Hilbert—sought to unify arithmetic and logic within a single syntactic framework. Gödel's incompleteness theorems (1931) demonstrated the impossibility of this project, showing that any consistent, recursively axiomatizable theory strong enough to encode arithmetic must be incomplete and cannot prove its own consistency. Furthermore, phenomena such as Tarski's undefinability of truth and the existence of non-standard models demonstrate that pure syntax faces a total epistemological collapse. This work argues that these metamathematical limits can be synthesized into a "Semantic Necessity Theorem": a complete, consistent, arithmetically strong theory cannot be purely syntactic. The Greek separation of arithmetic from formal logic thus appears not merely as a historical curiosity, but as a mathematically prescient framework that anticipates the structural necessity of ontology in modern mathematics.

Fields of Study & Subjects

History and Theory of Mathematics Advanced Topology and Set Theory Computability Logic AI Algorithms

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
23 March 2026
Language
EN
Document type
Preprint