Related papers: Beyond Uncountable
If $F$ and $G$ are iterated function systems, then any infinite word $W$ in the symbols $F$ and $G$ induces a limit set. It is natural to ask whether this Cantor set can also be realized as the limit set of a single $C^{1 + \alpha}$…
Justin Moore's weak club-guessing principle $\mho$ admits various possible generalizations to the second uncountable cardinal. One of them was shown to hold in ZFC by Shelah. A stronger one was shown to follow from several consequences of…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
According to Cantor, a set is a collection into a whole of defined and separate (we shall say distinct) objects. So, a natural question is ``How to treat as `sets' collections of indistinguishable objects?". This is the aim of quasi-set…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
This survey is devoted to necessary and suffcient conditions for a rational number to be representable by a Cantor series. Necessary and suffcient conditions are formulated for the case of an arbitrary sequence $(q_k)$.
We give iterative constructions for irreducible polynomials over F_q of degree nt^r for all nonnegative integers r, starting from irreducible polynomials of degree n. The iterative constructions correspond modulo fractional linear…
We examinate, formalize and extend the reasoning behind the Cantor's first diagonal argument, obtaining a simple closed-form expression for a bijection between $\mathbb{N}^k$ and $\mathbb{N}$.
Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Here, we study the…
We discuss two main ways in comparing and evaluating the size of sets: the "Cantorian" way, grounded on the so called Hume principle (two sets have equal size if they are equipotent), and the "Euclidean" way, maintaining Euclid's principle…
Two infinite sets $A$ and $B$ of nonnegative integers are called additive complements if their sumset contains every nonnegative integer. In 1964, Danzer constructed infinite additive complements $A$ and $B$ with $A(x)B(x) = (1 + o(1))x$ as…
The ternary Cantor set $\mathcal{C}$, constructed by George Cantor in 1883, is the best known example of a perfect nowhere-dense set in the real line. The present article we study the basic properties $\mathcal{C}$ and also study in detail…
Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…
In three papers Colbeck and Renner (Nature Communications 2:411, (2011); Phys. Rev. Lett. 108, 150402 (2012); arXiv:1208.4123) argued that "no alternative theory compatible with quantum theory and satisfying the freedom of choice assumption…
By Easton's theorem one can force the exponential function on regular cardinals to take rather arbitrary cardinal values provided monotonicity and Koenig's lemma are respected. In models without choice we employ a "surjective" version of…
A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…
By providing explanations for users and system designers to facilitate better understanding and decision making, explainable recommendation has been an important research problem. In this paper, we propose Counterfactual Explainable…
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…