Search arXivSearch

arXiv · 2311.09951

Counting Sets with Surnatural Numbers

Abstract

How many odd numbers are there? How many even numbers? From Galileo to Cantor, the suggestion was that there are the same number of odd, even and natural numbers, because all three sets can be mapped in one-one fashion to each other. This jars with our intuition: cardinality fails to discriminate between sets that are intuitively of different sizes. The class of surreal numbers $\boldsymbol{\mathsf{No}}$ is the largest possible ordered field. In this work we define a function, the magnum, mapping a selection of countable sets to a subclass of the surreals, the surnatural numbers $\boldsymbol{\mathsf{Nn}}$. Set magnums are found to be consistent with our intuition about relative set sizes. The magnum of a proper subset of a set is strictly less than the magnum of the set itself, in harmony with Euclid's axiom, ``the whole is greater than the part''. Two approaches are taken to specify magnums. First, they are determined by following the genetic assignment of magnums in the way the surreal numbers themselves are defined. Second, the domain of the counting sequence, which is defined for every countable set, is extended, to evaluate it on the surnatural numbers. The two methods are shown to be consistent. For a subset $A$ of $\mathbb{N}$, the magnum is defined as the value at $ω$ of the extended counting function of $A$. Larger sets are partitioned into finite components and a more general definition of magnums is presented. Several theorems concerning the properties of magnums are proved, and are employed to evaluate the magnums of a range of interesting countable sets. The relativity of the magnum function is discussed and a number of examples illustrate how its value depends on the choice and ordering of the reference set. In particular, we show how the rational numbers may be ordered in such a way that all unit rational intervals have equal magnums.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Lynch, Michael Mackey. 2025-01-26. Counting Sets with Surnatural Numbers. https://arxiv.org/abs/2311.09951

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

KEEP EXPLORING

Related papers

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

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO