arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1201.4408math.LOmath.CO
收藏

计算极大链

Computing Maximal Chains

Alberto Marcone, Antonio Montalbán, Richard A. Shore

摘要:

在1967年沃尔克证明,每一个良好的偏序(wpo)有一个最大的链,这是一个链的极大序模型。(Note WPO中的所有链都是有序的)。我们证明,这样的最大链不能计算,甚至超算术:没有超算术集可以计算所有可计算的wpos中的最大链。然而,我们证明了几乎每一个集合,在范畴的意义下,可以计算所有可计算的wpos中的极大链。沃尔克最初的结果实际上表明,每个wpo都有一个强极大链,我们在下面定义。我们证明了一个集合在所有可计算wpo中计算强极大链当且仅当它计算所有超算术集合。

英文摘要:

In 1967 Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even hyperarithmetically: No hyperarithmetic set can compute maximal chains in all computable wpos. However, we prove that almost every set, in the sense of category, can compute maximal chains in all computable wpos. Wolk's original result actually shows that every wpo has a strongly maximal chain, which we define below. We show that a set computes strongly maximal chains in all computable wpo if and only if it computes all hyperarithmetic sets.

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

↑