SearcharxivSearch

arXiv · 2112.12859

A Countable, Dense, Dedekind-Complete Subset of $\mathbb{R}$ Constructed by Extending $\mathbb{Q}$ via Simultaneous Marking of Closed Intervals with Rational Endpoints

Abstract

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are non-denumerable within ZF (Zermelo-Fraenkel set theory), the precise cardinality of the continuum remains unsettled and depends critically on model assumptions. For instance, under G\"odel's inner-model axiom V=Ultimate L, the Continuum Hypothesis (CH) holds, whereas Martin's Axiom implies its negation. The L\"owenheim-Skolem theorem further illustrates this relativity by demonstrating that any first-order theory admitting a non-denumerable model must also admit denumerable models, highlighting that even the notions of "denumerable" and "non-denumerable" are inherently model-relative. To examine these issues concretely, we construct two countable sets with properties typically attributed only to the continuum. First, within ZFC (ZF plus Axiom of Choice), we build a countable set $S_m$ from all closed intervals with rational endpoints. By assigning irrational marks simultaneously to each interval, respecting the nested interval structure, we obtain a set that is everywhere dense and Dedekind complete, yet countable. Next, we explicitly construct a similar set within Wang's $\Sigma$-model by systematically inserting irrational numbers between rational numbers via infinite diagonalization, resulting in a constructive enumeration of reals. These findings identify foundational tensions between classical proofs of non-denumerability and the Nested Interval Property, prompting a reevaluation of cardinality and CH within formal set theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Slavica Mihaljevic Vlahovic, Branislav Dobrasin Vlahovic. 2021-12-22. A Countable, Dense, Dedekind-Complete Subset of $\mathbb{R}$ Constructed by Extending $\mathbb{Q}$ via Simultaneous Marking of Closed Intervals with Rational Endpoints. https://arxiv.org/abs/2112.12859

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