Related papers: The Uncountability of the Unit Interval
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…
This paper presents and defends an argument that the continuum hypothesis is false, based on considerations about objective chance and an old theorem due to Banach and Kuratowski. More specifically, I argue that the probabilistic inductive…
Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…
We give an infinite number of proofs of Pythagoras theorem.Some can be classified as `self-similar proofs'.
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
The purpose of this memoir is to discuss two very interesting properties of integer sequences. One is the law of apparition and the other is the law of repetition. Both have been extensively studied by mathematicians such as Ward, Lucas,…
In the absence of the axiom of choice, new results concerning sequential, Fr\'echet-Urysohn, $k$-spaces, very $k$-spaces, Loeb and Cantor completely metrizable spaces are shown. New choice principles are introduced. Among many other…
{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…
Coherence is a defining property of quantum theory that accounts for quantum advantage in many quantum information tasks. Although many coherence quantifiers have been introduced in various contexts, the lack of efficient methods to…
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
The real unit interval is the fundamental building block for many branches of mathematics like probability theory, measure theory, convex sets and homotopy theory. However, a priori the unit interval could be considered an arbitrary choice…
For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every…