SearcharxivSearch

arXiv · 2207.07505

Euclidean integers, Euclidean ultrafilters, and Euclidean numerosities

Abstract

We introduce axiomatically the ring $\bf{Z}_\kappa$ of the Euclidean integers, that can be viewed as the ``integral part" of the field $\mathbb{E}$ of Euclidean numbers of [4], where the transfinite sum of ordinal indexed $\kappa$-sequences of integers is well defined. In particular any ordinal might be identified with the transfiite sum of its characteristic function, preserving the so called natural operations. The ordered ring $\bf{Z}_\kappa$ may be obtained as an ultrapower of $\mathbb{Z}$ modulo suitable ultrafilters, thus constituting a \it{ring of nonstandard integers.} Most relevant is the \it{algebraic} characterization of the ordering: a Euclidean integer is \it{positive} if and only if it is \it{the transfinite sum of natural numbers.} This property requires the use of special ultrafilters called Euclidean, here introduced to ths end. The ring $\bf{Z}_\kappa$ allows to assign a ``Euclidean" size (\it{numerosity}) to ``ordinal Punktmengen", i.e. sets of tuples of ordinals, as the transfinite sum of their characteristic functions: so every set becomes equinumerous to a set of ordinals, the Cantorian defiitions of \it{order, addition and multiplication} are maintained, while the Euclidean principle ``the whole is greater than the part" (\it{a set is (strictly) larger than its proper subsets}) is fulfilled.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mauro Di Nasso, Marco Forti. 2022-07-15. Euclidean integers, Euclidean ultrafilters, and Euclidean numerosities. https://arxiv.org/abs/2207.07505

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