arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.09329cs.LO
收藏

将集合编码为实数(扩展版)

Encoding Sets as Real Numbers (Extended version)

Domenico Cantone, Alberto Policriti

摘要:

本文研究了遗传有限集的Ackermann编码$\mathbb{N}(x) := \sum_{y\in x}2^{\mathbb{N}(y)}$的一个变形,它适用于遗传有限超集的较大集合$\mathsf{HF}^{1/2}$.通过在$\mathbb{N}$的定义中的每个指数之前简单地放置一个“减”号,得到表达式$\mathbb{R}(x) := \sum_{y\in x}2^{-\mathbb{R}(y)}$,从而获得所提出的变化。通过仔细的分析,我们证明了编码$\mathbb{R}_{A}$是良好定义的整个集合$\mathsf{HF}^{1/2}$,因为它允许一个单一的分配一个实值代码的每个遗传有限的超集。我们还解决了$\mathbb{R}_{A}$的注入性问题的一些初步情况。

英文摘要:

We study a variant of the Ackermann encoding $\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 $\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 $\mathbb{N}$, resulting in the expression $\mathbb{R}(x) := \sum_{y\in x}2^{-\mathbb{R}(y)}$. By a careful analysis, we prove that the encoding $\mathbb{R}_{A}$ is well-defined over the whole collection $\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 $\mathbb{R}_{A}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑