Related papers: Current research on G\"odel's incompleteness theor…
In this note we observe that automated theorem provers (ATPs) that recursively enumerate theorems in a particular way will fail to identify some valid theorems for a reason that is analogous to how G\"odel proved the existence of what are…
Goedel's Incompleteness Theorems have the same scientific status as Einstein's principle of relativity, Heisenberg's uncertainty principle, and Watson and Crick's double helix model of DNA. Our aim is to discuss some new faces of the…
From the perspective of the physics of complex systems (1) we deal with the current state of modern physics including the crisis in physics demonstrated through its epistemological, psychological, economical as well as the social context;…
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…
G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
From the perspective of the physics of complex systems (1) we deal with the current state of mod-ern physics including the crisis in physics demonstrated through its epistemological, psychological, economical as well as the social context;…
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.…
The first part of this paper contains an introduction to Bell inequalities and Tsirelson's theorem for the non-specialist. The next part gives an explicit optimum construction for the "hard" part of Tsirelson's theorem. In the final part we…
G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit…
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…
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.…
There is an increasing interest in applying recent advances in AI to automated reasoning, as it may provide useful heuristics in reasoning over formalisms in first-order, second-order, or even meta-logics. To facilitate this research, we…
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…
The first version of this paper gave another proof of the Kropholler Conjecture, which gives a relative version of Stallings Ends Theorem, following an earlier incorrect proof. It has been pointed out by Sam Shepherd that the the second…
In the paper it is demonstrated that Bells theorem is an unprovable theorem.
There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…
We investigate relationships between versions of derivability conditions for provability predicates. We show several implications and non-implications between the conditions, and we discuss unprovability of consistency statements induced by…