2016/01/13 by Giuseppe Raguní, Raguní, Giuseppe
Computer Science · Mathematics · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #Logic, Reasoning, and Knowledge #math.GM
paper · pdf · doi:10.48550/arxiv.1602.03389
submitted to "Review of Symbolic Logic"; 11 pages
arxiv created 2016/01/13 · arxiv updated 2016/02/11
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the second-order Logic that can be deduced by these same Theorems does not imply the standard semantic incompleteness that can be derived using the Loewenheim-Skolem or the compactness Theorem. This state of affairs has its origins in an incorrect and misinterpreted Goedel's comment at the Koenigsberg congress of 1930 and has consolidated due to different circumstances. This paper aims to clear up these questions and proposes an alternative interpretation for the Goedel's statement.