2015/03/10 by Giuseppe Raguní, Raguni, Giuseppe
Computer Science · #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #Logic (math.LO) #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1503.03087
openalex publication_date 2015/03/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The fundamental aim of the paper is to correct an harmful way to interpret a Goedel's erroneous remark at the Congress of Koenigsberg in 1930. Despite the Goedel's fault is rather venial, its misreading has produced and continues to produce dangerous fruits, as to apply the incompleteness Theorems to the full second-order Arithmetic and to deduce the semantic incompleteness of its language by these same Theorems. The first three paragraphs are introductory and serve to define the languages inherently semantic and its properties, to discuss the consequences of the expression order used in a language and some question about the semantic completeness: in particular is highlighted the fact that a non-formal theory may be semantically complete despite using a language semantically incomplete. Finally, an alternative interpretation of the Goedel's unfortunate comment is proposed. KEYWORDS: semantic completeness, syntactic incompleteness, categoricity, arithmetic, second-order languages, paradoxes