Encoding Sets as Real Numbers (Extended version)

Abstract

We study a variant of the Ackermann encoding N(x) := Σy∈ x2N(y) of the hereditarily finite sets by the natural numbers, applicable to the larger collection HF1/2 of the hereditarily finite hypersets. The proposed variation is obtained by simply placing a `minus' sign before each exponent in the definition of N, resulting in the expression R(x) := Σy∈ x2-R(y). By a careful analysis, we prove that the encoding RA is well-defined over the whole collection HF1/2, as it allows one to univocally assign a real-valued code to each hereditarily finite hyperset. We also address some preliminary cases of the injectivity problem for RA.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…