Euclidean integers, Euclidean ultrafilters, and Euclidean numerosities
Mauro Di Nasso, Marco Forti

TL;DR
This paper introduces the Euclidean integers ring, characterizes its algebraic and order properties, and applies it to define Euclidean size (numerosity) for ordinal sets, maintaining classical set operations.
Contribution
It axiomatizes the Euclidean integers ring, characterizes its order algebraically, and extends numerosity to ordinal sets while preserving classical set operations.
Findings
The Euclidean integers form an ultrapower of with a specific ultrafilter.
Positivity is characterized by transfinite sums of natural numbers.
Sets of ordinals can be assigned Euclidean sizes consistent with classical operations.
Abstract
We introduce axiomatically the ring of the Euclidean integers, that can be viewed as the ``integral part" of the field of Euclidean numbers of [4], where the transfinite sum of ordinal indexed -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 may be obtained as an ultrapower of 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 allows to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Analysis · Benford’s Law and Fraud Detection · Computability, Logic, AI Algorithms
