Related papers: Cantor versus Cantor
Let $Q=(q_n)_{n=1}^\infty$ be a sequence of bases with $q_i\ge 2$. In the case when the $q_i$ are slowly growing and satisfy some additional weak conditions, we provide a construction of a number whose $Q$-Cantor series expansion is both…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
De Finetti's betting argument is used to justify finitely additive probabilities when only finitely many bets are considered. Under what circumstances can countably many bets be used to justify countable additivity? In this framework, one…
In this paper we study admissible extensions of several theories T of reverse mathematics. The idea is that in such an extension the structure M = (N,S,\in) of the natural numbers N and collection of sets of natural numbers S has to obey…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
Following K. Mahler's suggestion for further research on intrinsic approximation on the Cantor ternary set, we obtain a Dirichlet type theorem for the limit sets of rational iterated function systems. We further investigate the behavior of…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
In this paper, we propose various sufficient conditions to determine if a given real number is an irrational number or a transcendental number and also apply these conditions to some interesting examples, particularly,one of them comes from…
From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring…
This text tries to give an elementary introduction to the mathematical properties of infinite sets. The aim is to keep the approach as simple as possible. Advanced knowledge of mathematics is not necessary for a proper understanding, and…
Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but…
Cantor's famous construction of the real continuum in terms of Cauchy sequences of rationals proceeds by imposing a suitable equivalence relation. More generally, the completion of a metric space starts from an analogous equivalence…
We prove that a self-similar Cantor set in $\mathbb{Z}_N \times \mathbb{Z}_N$ has a fractal uncertainty principle if and only if it does not contain a pair of orthogonal lines. The key ingredient in our proof is a quantitative form of…
We investigate how non-zero rational multiplication and rational addition affect normality with respect to $Q$-Cantor series expansions. In particular, we show that there exists a $Q$ such that the set of real numbers which are $Q$-normal…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
This work presents theorems which state (i) Z is a proper subset for any bijection f between A and Z, where Z is contained in P(A), A is a non-finite set and |Z|=|A|, and (ii) being Z a proper subset of P(A) nothing affirms or denies that…
A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…
In which a review of the concept of countability is done in mathematics, subjecting review some of the theorems so far accepted, showing their inconsistency and also taking concrete elements on the countability of all the powers of the set…