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

可内枚举性、自可归约性与随机性

Introenumerability, autoreducibility, and randomness

Ang Li

AI总结:

本文定义了 $Ψ$-自可归约集并证明其可测类测度为零,进而证明余全、可内枚举等枚举度类测度为零,并确定了各类随机集不能具有这些枚举度的最佳界限。

摘要:

我们定义了给定自归约过程 $Ψ$ 的 $Ψ$-自可归约集。然后,我们证明对于任何 $Ψ$,可测的 $Ψ$-自可归约集类测度为零。利用这一点,我们证明了余全、一致可内枚举、可内枚举和超余全枚举度的类测度均为零。通过分析余全集类和余全枚举度的算术复杂性,我们证明了弱2-随机集不能是余全的,弱3-随机集不能具有余全枚举度。接着,我们通过证明存在1-随机的余全集和具有余全枚举度的2-随机集,表明该结果是最佳的。对于一致可内枚举度和可内枚举度,我们再次利用 $Ψ$-自可归约性证明了最佳结果:没有弱3-随机集能具有可内枚举的枚举度。我们还证明了没有1-随机集是可内枚举的。

英文摘要:

We define $Ψ$-autoreducible sets given an autoreduction procedure $Ψ$. Then, we show that for any $Ψ$, a measurable class of $Ψ$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly introenumerable, introenumerable, and hyper-cototal enumeration degrees all have measure zero. By analyzing the arithmetical complexity of the classes of cototal sets and cototal enumeration degrees, we show that weakly 2-random sets cannot be cototal and weakly 3-random sets cannot be of cototal enumeration degree. Then, we see that this result is optimal by showing that there exists a 1-random cototal set and a 2-random set of cototal enumeration degree. For uniformly introenumerable degrees and introenumerable degrees, we utilize $Ψ$-autoreducibility again to show the optimal result that no weakly 3-random sets can have introenumerable enumeration degree. We also show that no 1-random set can be introenumerable.

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

↑