English

Encoding Sets as Real Numbers (Extended version)

Logic in Computer Science 2018-06-26 v1

Abstract

We study a variant of the Ackermann encoding N(x):=yx2N(y)\mathbb{N}(x) := \sum_{y\in x}2^{\mathbb{N}(y)} of the hereditarily finite sets by the natural numbers, applicable to the larger collection HF1/2\mathsf{HF}^{1/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\mathbb{N}, resulting in the expression R(x):=yx2R(y)\mathbb{R}(x) := \sum_{y\in x}2^{-\mathbb{R}(y)}. By a careful analysis, we prove that the encoding RA\mathbb{R}_{A} is well-defined over the whole collection HF1/2\mathsf{HF}^{1/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\mathbb{R}_{A}.

Cite

@article{arxiv.1806.09329,
  title  = {Encoding Sets as Real Numbers (Extended version)},
  author = {Domenico Cantone and Alberto Policriti},
  journal= {arXiv preprint arXiv:1806.09329},
  year   = {2018}
}

Comments

This is the extended version of a paper which will appear in the proceedings of SETS 2018