Related papers: Possible Worlds, Incompleteness and Undefinability
In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…
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…
What if the paradoxical nature of quantum theory could find its source in some undecidability analog to that of G\"odel's incompleteness theorem ? This essay aims at arguing for such G\"odelian hunch via two case studies. Firstly, using a…
The fact that the famous Godel incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of logician community.…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…
Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
This article discusses the logical errors in the liar paradox, G\"odel's incompleteness theorems, Russell's paradox, and the halting problem. In order to avoid these errors, a redefinition of logic has been presented, which is concluded as…
In this paper we consider an approach where both propositions and the accessibility relation are infinitely many-valued over G\"{o}del algebras. In particular, we consider separately the $\Box $-fragment and the $\Diamond $-fragment of our…
We analyze the informal notion of truth and conclude that it can be formalized in essentially two distinct ways: constructively, in terms of provability, or classically, as a hierarchy of concepts which satisfy Tarski's biconditional in…
We give proofs of G\"odel's incompleteness theorems after A. Joyal. The proof uses internal category theory in an arithmetic universe, a predicative generalisation of topoi. Applications to L\"ob's Theorem are discussed.
In Probabilistic Logic Nilsson uses the device of a probability distribution over a set of possible worlds to assign probabilities to the sentences of a logical language. In his paper Nilsson concentrated on inference and associated…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…
An ultimate universal theory -- a complete theory that accounts, via few and simple first principles, for all the phenomena already observed and that will ever be observed -- has been, and still is, the aspiration of most physicists and…
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…
It is a widespread belief that results like G\"odel's incompleteness theorems or the intrinsic randomness of quantum mechanics represent fundamental limitations to humanity's strive for scientific knowledge. As the argument goes, there are…
I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…