Related papers: G\"odel's Theorem and Direct Self-Reference
This note provides a counterexample to a theorem announced in the last part of the paper ''Analysis of direct searches for discontinuous functions'', Mathematical Programming Vol. 133, pp.~299--325, 2012. The counterexample involves an…
Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…
Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for…
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…
Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…
In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
The issue of causality in $f(T)$ gravity is investigated by examining the possibility of existence of the closed timelike curves in the G\"{o}del-type metric. By assuming a perfect fluid as the matter source, we find that the fluid must…
We prove some constructive results that on first and maybe even on second glance seem impossible.
After highlighting the cases in which the semantics of a language cannot be mechanically reproduced (in which case it is called inherent), the main epistemological consequences of the first incompleteness Theorem for the two fundamental…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn…
The concept of informal mathematical proof considered in intuitionism is apparently vulnerable to a version of the liar paradox. However, a careful reevaluation of this concept reveals a subtle error whose correction blocks the…
We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…
If we apply an extension of the Deduction meta-Theorem to Goedel's meta-reasoning of "undecidability", we can conclude that Goedel's formal system of Arithmetic is not omega-consistent. If we then take the standard interpretation…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…
Based on the MRDP theorem, we introduce the ideas of the proof equation of a formula and universal proof equation of Peano Arithmetic (PA); and then, combining universal proof equation and G\"odel's Second Incompleteness Theorem, it is…
An algebra $A$ is said to be directly finite if each left invertible element in the (conditional) unitization of $A$ is right invertible. We show that the reduced group ${\rm C}^\ast$-algebra of a unimodular group is directly finite,…
The Hilbert program was actually a specific approach for proving consistency. Quantifiers were supposed to be replaced by $\epsilon$-terms. $\epsilon{x}A(x)$ was supposed to denote a witness to $\exists{x}A(x)$, arbitrary if there is none.…