SearcharxivSearch

arXiv · 1905.06519

The Constituents of Sets, Numbers, and Other Mathematical Objects, Part Two

Abstract

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The operation that implements addition when applied to sets that represent natural numbers yields both addition and subtraction when used with the sets that encode integers. The encoding of the integers naturally extends beyond them and identifies sets that encode arithmetic expressions and rational numbers. The sets that encode arithmetic expressions naturally specify the set operations that should be performed to evaluate those expressions. The natural encoding of rational numbers within sets expresses each rational number as a novel order-preserving form of continued fraction, which provides a new efficient algorithm for finding rational approximations to irrational numbers. It also arranges all rational numbers within a tree that shows which numbers are constituents of which others. The part of this tree containing the positive rationals coincides with the well-known Stern-Brocot tree, which it extends to all rationals, including zero and negative numbers, introducing new non-trivial symmetries. These symmetries overlap with each other and form a group isomorphic to the group of symmetries of an equilateral triangle.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruadhan O'Flanagan. 2019-05-15. The Constituents of Sets, Numbers, and Other Mathematical Objects, Part Two. https://arxiv.org/abs/1905.06519

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