Related papers: A Non-Constructive Proof of Cantor's Theorem
Cantor's first idea to build a one-to-one mapping from the unit interval to the unit square did not work since, as pointed out by Dedekind, the so-obtained function is not surjective. Here, we start from this function and modify it (on a…
A digraph $D=\langle V,E\rangle$ ($E\subset V\times V$) is Cantor if Cantor's theorem - for no set there is a surjection from it to its power set - holds in $D$, in the sense we explain. We construct a ZF formula $\varphi$ with length $494$…
This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…
A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…
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…
The aim of this paper is to present a very simple original, purely formal, proof of Quillen's adjunction theorem for derived functors, and of some more recent variations and generalizations of this theorem. This is obtained by proving an…
We give a constructive proof of Carpenter's Theorem due to Kadison. Unlike the original proof our approach also yields the real case of this theorem.
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…
We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient…
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…
Recently, Colbeck and Renner (2011) [arXiv:1005.5173] published a theorem that appears to be stronger than the Bell (1964) theorem in a way that is more significant than the other variations of Bell's theorem that have been published in the…
In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…
We present a characterization of sets for which Cartwright's theorem holds true. The connection is discussed between these sets and sampling sets for entire functions of exponential type.
In his first set theory paper (1874), Cantor establishes the uncountability of $\mathbb{R}$. We study the latter in Kohlenbach's higher-order Reverse Mathematics, motivated by the observation that one cannot study concepts like `arbitrary…
In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…
We construct a function that lies in $L^p(\mathbb{R}^d)$ for every $p \in (1,\infty]$ and whose Fourier transform has no Lebesgue points in a Cantor set of full Hausdorff dimension. We apply Kova\v{c}'s maximal restriction principle to show…
Let M be a II_1 factor, A a masa in M and E the unique conditional expectation on A. Under some technical assumptions on the inclusion of A in M, which hold true for any semiregular masa of a separable factor, we show that for every…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
We construct "large" Cantor sets whose complements resemble the unit disk arbitrarily well from the point of view of the squeezing function, and we construct "large" Cantor sets whose complements do not resemble the unit disk from the point…