Encoding Sets as Real Numbers (Extended version)
Logic in Computer Science
2018-06-26 v1
Abstract
We study a variant of the Ackermann encoding of the hereditarily finite sets by the natural numbers, applicable to the larger collection of the hereditarily finite hypersets. The proposed variation is obtained by simply placing a `minus' sign before each exponent in the definition of , resulting in the expression . By a careful analysis, we prove that the encoding is well-defined over the whole collection , 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 .
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