Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1706.08908

The Ordinals as a Consummate Abstraction of Number Systems

Alec Rhea
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the course of many mathematical developments involving 'number systems' like $\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb {C}$ etc., it sometimes becomes necessary to abstract away and study certain properties of the number system in question so that we may better understand objects having these properties in a more general setting -- a relevant example for this paper would be Hausdorffs $\eta_\varepsilon$-fields, objects abstracted from the property that there are no two disjoint intervals in $\mathbb{R}$ of cardinality $\alpha \leq \aleph_0$ whose union is $\mathbb{R}$. My goal will be to reverse this process, so to speak -- I will begin in one of the most abstract mathematical settings possible, using only the undefined notions and axioms of MK class theory to define and subsequently add structure to the class of all ordinals, $O_n$. I proceed in this fashion until the construction (or a subclass thereof) is structurally isomorphic to whichever 'number system' we wish to consider. In the course of doing so, I construct a proper class of set-sized non-isomorphic discretely ordered rings and a proper class-sized discretely ordered ring, a proper class of non-isomorphic set-sized densely ordered fields that are not real-closed and a proper class sized densely ordered field that is not real-closed, a proper class of non-isomorphic real-closed fields, and a proper class of non-isomorphic algebraically closed fields. I also propose a new definition for the Surreal and Surcomplex numbers, using a 'final culmination' of the process used to construct real-closed fields and their algebraic closures. This process yields a straightforward and logically satisfying method for moving back and forth between well-studied number systems like $\mathbb{R}$ and very abstract number systems, such as an $\eta_{_{\omega^\omega}}$-field.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Alec Rhea. 2017-06-23. The Ordinals as a Consummate Abstraction of Number Systems. https://arxiv.org/abs/1706.08908

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗