论文标题
来自所有无限子集的计算集
Computing sets from all infinite subsets
论文作者
论文摘要
如果可以通过自身的每个无限子集计算一个集合，则可以进行内部。可以将这样的集合视为编码信息。我们研究了不可抑制的集合和相关概念。我们的两个主要结果是，可固定集的集合是$π^1_1 $ - complete，因此不对可安置的集合没有简单的表征。并且每个静脉内套件都有一个可固定的子集。
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the collection of introreducible sets is $Π^1_1$-complete, so that there is no simple characterization of the introreducible sets; and that every introenumerable set has an introreducible subset.
