Related papers: Bolzano and the Part-Whole Principle

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 apply the Inclusion-Exclusion Principle to a unique pair of prime number subsequences to determine whether these subsequences form a small set or a large set and thus whether the infinite sum of the inverse of their terms converges or…

Let $K$ denote the middle third Cantor set and ${\cal A}:= \{3^n : n = 0,1,2, >... \} $. Given a real, positive function $\psi$ let $ W_{\cal A}(\psi)$ denote the set of real numbers $x$ in the unit interval for which there exist infinitely…

The Cosmological Principle (CP) -- the notion that the Universe is spatially isotropic and homogeneous on large scales -- underlies a century of progress in cosmology. It is conventionally formulated through the…

The first author introduced a measure of compactness for families of sets, relative to a class of filters, in the context of convergence approach spaces. We characterize a variety of maps (types of quotient maps, closed maps, and variants…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…

Using first principles from inference, we design a set of functionals for the purposes of \textit{ranking} joint probability distributions with respect to their correlations. Starting with a general functional, we impose its desired…

Let $G$ be a linear algebraic group defined over an algebraically closed field. The double coset question addressed in this paper is the following: Given closed subgroups $X$ and $P$, is the double coset collection $X\backslash G/P$ finite…

Taking a quotient roughly means changing the notion of equality on a given object, set or type. In a quantitative setting, equality naturally generalises to a distance, measuring how much elements are similar instead of just stating their…

Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic…

Within the framework of the individuality interpretation of quantum theory (QT), the basic equations of QT cannot be derived from the basic equations of classical mechanics (CM). The unbridgeable gap between CM and QT is given by the fact…

We investigate unitary and state $t$-designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) $t$-designs. We present a quantum algorithm for computing…

Everettian Quantum Mechanics, or the Many Worlds Interpretation, lacks an explanation for quantum probabilities. We show that the values given by the Born rule equal projection factors, describing the contraction of Lebesgue measures in…

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision,…

We continue our investigation of the fractal uncertainty principle (FUP) for random fractal sets. In the prequel (arXiv:2107.08276), we considered the Cantor sets in the discrete setting with alphabets randomly chosen from a base of digits…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

We consider an extended variant of the classical coupon collector's problem with infinite number of collections. An arriving coupon is placed in the $r^{th}$ collection, $r\ge0$, if $r$ is the smallest index such that the corresponding…

The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…