arXiv 1007.36922010-07math.LO

A bounded jump for the bounded Turing degrees

Bernard A. Anderson, Barbara F. Csima

备注：: 22 pages. Minor changes for publication
发表信息：: Notre Dame J. Formal Logic 55, no. 2 (2014), 245-264
DOI：: 10.1215/00294527-2420660

英文摘要：

We define the bounded jump of A by A^b = {x | Exists i <= x [phi_i (x) converges and Phi_x^[A|phi_i(x)](x) converges} and let A^[nb] denote the n-th bounded jump. We demonstrate several properties of the bounded jump, including that it is strictly increasing and order preserving on the bounded Turing (bT) degrees (also known as the weak truth-table degrees). We show that the bounded jump is related to the Ershov hierarchy. Indeed, for n > 1 we have X <=_[bT] 0^[nb] iff X is omega^n-c.e. iff X <=_1 0^[nb], extending the classical result that X <=_[bT] 0' iff X is omega-c.e. Finally, we prove that the analogue of Shoenfield inversion holds for the bounded jump on the bounded Turing degrees. That is, for every X such that 0^b <=_[bT] X <=_[bT] 0^[2b], there is a Y <=_[bT] 0^b such that Y^b =_[bT] X.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Turing jumps through provability

Fixing some computably enumerable theory $T$, the Friedman-Goldfarb-Harrington (FGH) theorem says that over elementary arithmetic, each $Σ_1$ formula is equivalent to some formula of the form $\Box_T φ$ provided that $T$ is consistent. In this paper we give various generalizations of the FGH theorem. In particular, for $n>1$ we relate $Σ_{n}$ formulas to provability statements $[n]_T^{\sf True}φ$ which are a formalization of "provable in $T$ together with all true $Σ_{n+1}$ sentences". As a corollary we conclude that each $[n]_T^{\sf True}$ is $Σ_{n+1}$-complete. This observation yields us to …

2015-01-21math.LO

图灵度理想完备中的跳跃闭包与极限一致化

Jump Closure and Limit Uniformization in the Ideal Completion of the Turing Degrees

该研究针对图灵度理想完备的跳跃闭包问题，引入极限一致化算子，揭示其与斯科特连续性失效的关联，为超限图灵跳跃层级提供域论语义。

2026-08-27cs.LOmath.LO

Turing degree spectra of differentially closed fields

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a single derivation) whose spectrum does not contain the computable degree 0. Indeed, this is an equivalence, for we also show that every such field of low degree is isomorphic to a computable differential field. Relativizing the latter result and applying a theorem of Montalban, Soskova, and Soskov, we conclude that the spectra of countable differentially clo…

2018-02-08math.LO

Turing Degrees and Automorphism Groups of Substructure Lattices

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of investigation in computable model theory. In this paper, we focus on the lattice structure of computably enumerable substructures of a given canonical computable structure. In particular, for a Turing degree $\mathbf{d}$, we investigate the groups of $\mathbf{d}$ -computable automorphisms of the lattice of $\mathbf{d}$-computably enumerable vector spaces, o…

2018-11-03math.LO

Post's problem for supertasks has both positive and negative solutions

Recently we have introduced a new model of infinite computation by extending the operation of ordinary Turing machines into transfinite ordinal time. In this paper we will show that the infinite time Turing machine analogue of Post's problem, the question whether there are supertask degrees between 0 and the supertask jump 0^jump, has in a sense both positive and negative solutions. Namely, in the context of the reals there are no degrees between 0 and 0^jump, but in the context of SETS of reals, there are; indeed, there are incomparable semi-decidable supertask degrees. Both arguments employ …

1998-08-31math.LO

Lattice initial segments of the Turing degrees

We characterize the isomorphism types of principal ideals of the Turing degrees below 0' that are lattices as the lattices with a Sigma-0-3 presentation, by showing that each Sigma-0-3 presentable bounded upper semilattice is isomorphic to such a principal ideal. We get a similar result for the Turing degrees below any degree above 0".

2011-07-13math.LO

更多相关论文收起更多论文

图灵跳跃与极限之间的伽罗瓦连接

A Galois connection between Turing jumps and limits

本文通过图灵跳跃与极限的伴随关系建立伽罗瓦连接，刻画极限可计算函数类，并证明在可计算度量空间上，相对于停机问题的可计算性等价于具有可计算连续模的极限可计算性，且利普希茨连续函数自动满足此性质。

2018-08-30cs.LOmath.LO

Variations on $Δ^1_1$ Determinacy and $\aleph_{ω_1}$

We consider a seemingly weaker form of $Δ^1_1$ Turing determinacy. Let $2 \leq ρ< ω_1^{\textrm{CK}}$, $\textrm{Weak-Turing-Det}_ρ(Δ^1_1)$ is the statement: Every $Δ^1_1$ set of reals cofinal in the Turing degrees contains two Turing distinct, $Δ^0_ρ$-equivalent reals. We show in $\textrm{ZF}^-$: $\textrm{Weak-Turing-Det}_ρ(Δ^1_1)$ implies: for every $ν< ω_1^{\textrm{CK}}$ there is a transitive model: $M \models \textrm{ZF}^- + \aleph_ν\textrm{ exists}$. As a corollary: If every cofinal $Δ^1_1$ set of Turing degrees contains both a degree and its jump, then for every $ν< ω_1^{\textrm{CK}}$, the…

2022-06-17math.LO

The Hilbert's-Tenth-Problem Operator

For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$, which is naturally viewed as a set of polynomials in $\mathbb Z[X_1,X_2,\ldots]$. For $W=\emptyset$, it is a famous result of Matiyasevich, Davis, Putnam, and Robinson that the jump $\emptyset~\!'$ is Turing-equivalent to $HTP(\mathbb Z)$. More generally, $HTP(\mathbb Z[W^{-1}])$ is always Turing-reducible to $W'$, but not necessarily equivalent. We show here th…

2018-02-08math.LOmath.NT

The Veblen functions for computability theorists

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a well-ordering, then so is phi(alpha,X)", where alpha is a fixed computable ordinal and phi the two-placed Veblen function. For the former statement, we show that omega iterations of the Turing jump are necessary in the proof and that the statement is equivalent to ACA_0^+ over RCA_0. To prove the latter statement we need to use omega^alpha iterations of the Turing jump, and we show that the statement is equivalent to P…

2010-07-06math.LO

超跳的图灵度

Turing Degrees of Hyperjumps

本文证明超算术版本的Posner-Robinson定理，即任何非超算术图灵度都可表示为相对于某个实数的超跳，推广了经典图灵跳跃的结果。

2024-07-19math.LO

枚举度中的马丁猜想

Martin's Conjecture in the Enumeration Degrees

本文研究枚举度上的马丁猜想，证明一致不变函数局部上仅表现为常值、递增或位于跳跃算子之上，并构造出在任何锥上都不等价于一致不变函数的可定义函数。

2025-11-07math.LO

Towards characterizing the $>ω^2$-fickle recursively enumerable Turing degrees

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can be bounded. Two important characterizations are of the $L_7$ and $M_3$ lattices, where the lattices are bounded below $\mathbf{d}$ if and only if $\mathbf{d}$ contains sets of ``\emph{fickleness}'' $>ω$ and $\geqω^ω$ respectively. We work towards finding a lattice that characterizes the levels above $ω^2$, the first non-trivial level after $ω$. We considere…

2021-11-27math.LO

Chaitin's Omega and an Algorithmic Phase Transition

We consider the statistical mechanical ensemble of bit string histories that are computed by a universal Turing machine. The role of the energy is played by the program size. We show that this ensemble has a first-order phase transition at a critical temperature, at which the partition function equals Chaitin's halting probability $Ω$. This phase transition has curious properties: the free energy is continuous near the critical temperature, but almost jumps: it converges more slowly to its finite critical value than any computable function. At the critical temperature, the average size of the …

2021-02-05cs.CCcs.IThep-th

Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega

Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every computably enumerable (c.e.) real, there exists a Turing functional via which Omega computes it, and such that the number of bits of omega that are needed for the computation of the first n bits of the given number (i.e. the use on argument n) is bounded above by a computable function h(n) = n+o(n). We characterise the asymptotic upper bounds on the use of Ch…

2016-05-03cs.CCcs.LOmath.LO