Related papers: Observations concerning G\"odel's 1931
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
Cox's well-known theorem justifying the use of probability is shown not to hold in finite domains. The counterexample also suggests that Cox's assumptions are insufficient to prove the result even in infinite domains. The same…
In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…
The founding of the theory of cylindric algebras, by Alfred Tarski, was a conscious effort to create algebras out of first order predicate calculus. Let $n\in\omega$. The classes of non-commutative cylindric algebras ($NCA_n$) and weakened…
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…
The paper has been withdrawn by the author, due a gap in the proof of Theorem 6.1. The gap was discovered by M. Van den Bergh. Theorem 6.1 is used to prove the main result of the paper, namely Theorem 0.7 (decomposition in arbitrary…
This paper has been withdrawn by the author(s), due a crucial sign error in Thm. 11.
We demonstrate that theories $\text{Z}^-$, $\text{ZF}^-$, $\text{ZFC}^-$ (minus means the absence of the Power Set axiom) and $\text{PA}_2$, $\text{PA}_2^-$ (minus means the absence of the Countable Choice schema) are equiconsistent to each…
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…
This second pedagogical installment on the history of the Vogt-Russell theorem focuses on research in the 1970s on the existence and uniqueness of star models. An appendix presents stellar evolution models, computed with the MESA code, in…
In the proof of Lemma 2.6 (2) the iteration of the map {\tau} was not performed properly and in fact the lemma is wrong; a counterexample is given by f = \bar{x}_1and k = 2. This error does not, however, affect the geometric…
We study abstract versions of G\"odel's second incompleteness theorem and formulate generalizations of L\"ob's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in G\"odel's…
Answering a question posed by Bergelson and Leibman in [6], we establish a nilpotent version of the polynomial Hales-Jewett theorem that contains the main theorem in [6] as a special case. Important to the formulation and the proof of our…
The proofs that the real numbers are denumerable will be shown, i.e., that there exists one-to-one correspondence between the natural numbers $N$ and the real numbers $\Re$. The general element of the sequence that contains all real numbers…
In this paper, we reconstruct Euclid's theory of similar triangles, as developed in Book VI of the \textit{Elements}, along with its 20th-century counterparts, formulated within the systems of Hilbert, Birkhoff, Borsuk and Szmielew, Millman…
The statements of Main~Theorem~1.1 and Theorem~2.1 of the author's paper [\emph{Trans.\ Amer.\ Math.\ Soc.}\ {\bf 345} (1994) 577--594] should assume that $\Gamma $~is discrete and $G$~is connected. (Cors.~1.3, 5.6, and~5.8 are affected…
The prenex fragments of first-order infinite-valued Goedel logics are classified. It is shown that the prenex Goedel logics characterized by finite and by uncountable subsets of [0, 1] are axiomatizable, and that the prenex fragments of all…
The conjecture of Serre referred in the title is the one about modularity of odd Galois representations into GL(2,F) where F is a finite field of characteristic p. We present an analogous conjecture where GL(2) is replaced by GL(n). We…
Goodstein's argument is essentially that the hereditary representation m_{[b]} of any given natural number m in the natural number base b can be mirrored in Cantor Arithmetic, and used to well-define a finite decreasing sequence of…
This paper has been withdrawn by the author due to a crucial sign error in equation which we use from Ref. 7 that is incorrect. In particular, Eq.(1-8) is not the correct equation from the variation of N. See, for example, Eq.(6) in PRD93,…