Related papers: G\"odel incompleteness through Arithmetic Universe…
The purpose of this paper is to elucidate, by means of concepts and theorems drawn from mathematical logic, the conditions under which the existence of a multiverse is a logical necessity in mathematical physics, and the implications of…
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…
For which choices of $X,Y,Z\in\{\Sigma^1_1,\Pi^1_1\}$ does no sufficiently strong $X$-sound and $Y$-definable extension theory prove its own $Z$-soundness? We give a complete answer, thereby delimiting the generalizations of G\"odel's…
The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…
In this article we discuss the proof in the short unpublished paper appeared in the 3rd volume of Godel's Collected Works entitled "On undecidable sentences" (*1931?), which provides an introduction to Godel's 1931 ideas regarding the…
Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…
A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
In this paper we briefly review and analyze three published proofs of Chaitin's theorem, the celebrated information-theoretic version of G\"odel's incompleteness theorem. Then, we discuss our main perplexity concerning a key step common to…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
Goedel's results have had a great impact in diverse fields such as philosophy, computer sciences and fundamentals of mathematics. The fact that the rule of mathematical induction is contradictory with the rest of clauses used by Goedel to…
It is generally accepted that the incompleteness of first-order number theory (PA) is established by an application of Godel's proof. This paper shows that the arithmetization of the syntax of PA implies that the hypothesised class of PA…
In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.
Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G\"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true…
We present an analogue of G\"{o}del's second incompleteness theorem for systems of second-order arithmetic. Whereas G\"{o}del showed that sufficiently strong theories that are $\Pi^0_1$-sound and $\Sigma^0_1$-definable do not prove their…
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
For a certain class of abelian categories, we show how to make sense of the "Euler characteristic" of an infinite projective resolution (or, more generally, certain chain complexes that are only bounded above), by passing to a suitable…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
According to Chaitin, G\"odel once told him "it doesn't matter which paradox you use [to prove the First Incompleteness Theorem]". In this paper I will present a few infinitary paradoxes and show how to "translate" them to some undecidable…