Related papers: Addressing mathematical inconsistency: Cantor and …
We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…
We give a precise definition of a formal mathematical object as any symbol for an individual constant, predicate letter, or a function letter that can be introduced through definition into a formal mathematical language without inviting…
In this article we discuss the proof in the short unpublished paper appeared in the 3rd volume of Godel's Collected Works entitled "On undecidable sentences" (*1931?), which provides an introduction to Godel's 1931 ideas regarding the…
The embracing of actual infinity in mathematics leads naturally to the question of comparing the sizes of infinite collections. The basic dilemma is that the Cantor Principle (CP), according to which two sets have the same size if there is…
The primary aim of Hilbert's proof theory was to establish the consistency of classical mathematics using finitary means only. Hilbert's strategy for doing this was to eliminate the infinite (in the form of unbounded quantifiers) from…
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…
In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…
We determine the sets definable in expansions of the ordered real additive group by generalized Cantor sets. Given a natural number $r\geq 3$, we say a set $C$ is a generalized Cantor set in base $r$ if there is a non-empty…
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…
It is a ubiquitous opinion among mathematicians that a real number is just a point in the line. If this rough definition is not enough, then a mathematician may provide a formal definition of the real numbers in the set theoretic and…
We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…
This paper is an investigation into Cantor works about representing a function with trigonometric series, and his proofs about its uniqueness. These works are important, because they cause invention of point-set topology, and foundation of…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We construct a class of homogeneous Cantor-Moran measures with all contraction ratios being reciprocal of integers, and prove that they are pointwise absolutely normal. Our approach relies on methods developed by Davenport, Erd{\H{o}}s, and…
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…