图灵度理想完备中的跳跃闭包与极限一致化
Jump Closure and Limit Uniformization in the Ideal Completion of the Turing Degrees
浏览论文内容
中文总结 AI 辅助
该研究针对图灵度理想完备的跳跃闭包问题，引入极限一致化算子，揭示其与斯科特连续性失效的关联，为超限图灵跳跃层级提供域论语义。
中文摘要 AI 辅助
图灵跳跃在图灵度上没有不动点：对任意度 a，均有 a <_T a'。然而，在过渡到理想完备后，会出现自然的不动点现象。我们研究斯科特连续提升 Γ: Idl(D_T)→Idl(D_T)，定义为 Γ(I)=↓{a':a∈I}。从可计算度出发，Kleene 迭代在阶段 ω 达到第一个不动点，即算术度的图灵理想；更一般地，在 a 之上的最小不动点是 a 中算术度的理想。为超越该不动点，我们引入极限一致化算子。尽管有限跳跃理想包含所有 0^{(n)}，但它不包含一致极限谕示 0^{(ω)}=°_T(⊕_{n<ω}0^{(n)})。一致化算子仅在所有有限跳跃度都存在时才添加该谕示，它是单调的但非斯科特连续的。将跳跃闭包与一个此类算子复合，得到闭包序数 ω·2；在 ω,2ω,3ω,… 处添加算子，得到闭包序数 ω²。因此，在相对停机问题下的非一致闭包是斯科特连续的，可达到不动理想；而对整个先前层级的一致编码是无穷的、不连续的，且会重新开启对角化。这为超限图灵跳跃层级中的后继/极限区分提供了域论语义，并将斯科特连续性的失效与闭包序数关联起来。
英文摘要
The Turing jump has no fixed point on the Turing degrees: $\mathbf a <_T \mathbf a'$ for every degree $\mathbf a$. After passing to the ideal completion, however, a natural fixed-point phenomenon appears. We study the Scott-continuous lifting $Γ:\operatorname{Idl}(\mathbf D_T)\to\operatorname{Idl}(\mathbf D_T)$, given by $Γ(I)=\downarrow\{\mathbf a':\mathbf a\in I\}$. Starting from the computable degree, Kleene iteration reaches its first fixed point at stage $ω$, namely the Turing ideal of arithmetical degrees; more generally, above $\mathbf a$ the least fixed point is the ideal of degrees arithmetical in $\mathbf a$. To pass beyond this fixed point, we introduce a limit-uniformization operator. Although the ideal of finite jumps contains every $\mathbf 0^{(n)}$, it does not contain the uniform limit oracle $\mathbf 0^{(ω)}=°_T\!\left(\bigoplus_{n < ω}0^{(n)}\right)$. The uniformization operator adjoins this oracle only when all finite jump degrees are present. It is monotone but not Scott-continuous. Composing jump closure with one such gate yields closure ordinal $ω\cdot 2$; gates at $ω,2ω,3ω,\ldots$ yield closure ordinal $ω^2$. Thus non-uniform closure under relativized halting problems is Scott-continuous and reaches fixed ideals, while uniform coding of an entire prior hierarchy is infinitary, discontinuous, and reopens diagonalization. This gives a domain-theoretic semantics for the successor/limit distinction in transfinite Turing-jump hierarchies and links failures of Scott continuity with closure ordinals.
