Related papers: The Uncountability of the Unit Interval
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…
Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is…
The article is devoted to the investigation of representation of rational numbers by Cantor series. Necessary and sufficient conditions for a rational number to be representable by a positive Cantor series are formulated for the case of an…
The recent paper by Mohr and Phillips (arXiv:1409.2794) describes several problems relating to the treatment of angle measurement within SI, the unit hertz, and quantities that can be considered countable (rather than measureable). However,…
We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…
In 1895, Cantor showed that between every two countable dense real sets, there is an order isomorphism. In fact, there is always such an order isomorphism, which is the restriction of a universal entire function.
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
Is there a number for every bit of spacetime, or is spacetime smooth like the real line? The ultimate fate of a quantum theory of gravity might depend on it. The troublesome infinities of quantum gravity can be cured by assuming that…
Discussions surrounding the nature of the infinite in mathematics have been underway for two millennia. Mathematicians, philosophers, and theologians have all taken part. The basic question has been whether the infinite exists only in…
The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
Indeterminacy associated with probing of a quantum state is commonly expressed through spectral distances (metric) featured in the outcomes of repeated experiments. Here we express it as an effective amount (measure) of distinct outcomes…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…