SearcharxivSearch

arXiv · 2404.01256

The Countable Reals

Abstract

We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter. Realizers operate uniformly with respect to a given parameter set. Our construction uses a sequence of reals in $[0,1]$, discovered by Joseph Miller, that is non-diagonalizable in the sense that any real which is oracle-computable uniformly from representations of the sequence must already appear in it. When used as the parameter set, this yields a topos in which the non-diagonalizable sequence becomes an epimorphism onto the Dedekind reals, rendering them internally countable. The resulting topos is intuitionistic: it refutes both the law of excluded middle and countable choice. Nevertheless, much of analysis survives internally. The Cauchy reals are uncountable. The Hilbert cube is countable, so Brouwer's fixed-point theorem follows from Lawvere's. The intermediate value theorem and the analytic form of the lesser limited principle of omniscience hold, while the limited principle of omniscience fails. Although no real-valued map has a jump, it remains open whether all such maps are continuous. Finally, the closed interval $[0,1]$, being countable, can be covered by a sequence of open intervals of total length less than any $\epsilon > 0$, with no finite subcover. Yet, we show that any cover using intervals with rational endpoints must admit a finite subcover.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrej Bauer, James E. Hanson. 2024-04-01. The Countable Reals. https://arxiv.org/abs/2404.01256

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO