Search arXivSearch

arXiv · 2207.07505

Euclidean integers, Euclidean ultrafilters, and Euclidean numerosities

Abstract

We introduce axiomatically the ring $\bf{Z}_κ$ 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 $κ$-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}_κ$ 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}_κ$ 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-12-05. 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO