相关论文: Observations concerning G\"odel's 1931
This article examines the formula G (of Goedel). We demonstrated that the Goedel's number of the formula G is not a finite number if (i) G is comprehended as a self-referential statement or (ii) there is an infinite set S of well-formed…
Recent work by Pain [1] proposed a systematic approach to evaluating binomial sums involving reciprocals of binomial coefficients via Beta integrals. In particular, a parametric extension (Proposition 6.1) was introduced and claimed to…
This paper has been withdrawn by the author. Lemma 8 is used in the proof of Lemma 6, but it is not correct. Lemma 6 is essential for the main results.
The fundamental aim of the paper is to correct an harmful way to interpret a Goedel's erroneous remark at the Congress of Koenigsberg in 1930. Despite the Goedel's fault is rather venial, its misreading has produced and continues to produce…
In this paper we give two theorems from the Propositional Calculus of the Boolean Logic with their consequences and applications and we prove them axiomatically.
First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…
For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…
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…
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…
The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…
In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly…
In A Study of Spinoza's Ethics (1984, {\S}17), Jonathan Bennett argues that the demonstration of Proposition V of Spinoza's Ethica contains identifiable invalid moves and that, even granted those moves, "cannot yield more than the…
$\mathsf{ZF + AD}$ proves that for all nontrivial forcings $\mathbb{P}$ on a wellorderable set of cardinality less than $\Theta$, $1_{\mathbb{P}} \Vdash_{\mathbb{P}} \neg\mathsf{AD}$. $\mathsf{ZF + AD} + \Theta$ is regular proves that for…
Let $n \neq 8$ be a positive integer such that $n+1 \neq 2^u$ for any integer $u\geq 2$. Let $\phi(x)$ belonging to $\mathbb{Z}[x]$ be a monic polynomial which is irreducible modulo all primes less than or equal to $n+1$. Let $a_j(x)$ with…
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.
This survey text deals with irrationality, and linear independence over the rationals, of values at positive odd integers of Riemann zeta function. The first section gives all known proofs (and connections between them) of Ap\'ery's Theorem…
Mermin states that his nontechnical version of Bell's theorem stands and is not invalidated by time and setting dependent instrument parameters as claimed in one of our previous papers. We identify deviations from well-established protocol…
G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…
We extend the Dong-Mason theorem on the irreducibility of modules for orbifold vertex algebras from [C. Dong, G. Mason, Duke Math. J. 86 (1997)] 305-321] for the category of weak modules. Let $V$ be a vertex operator algebra, $g$ an…
We formally define a "mathematical object" and "set". We then argue that expressions such as "(Ax)F(x)", and "(Ex)F(x)", in an interpretation M of a formal theory P, may be taken to mean "F(x) is true for all x in M", and "F(x) is true for…