Abstract
The strong homogeneity conjecture asserts that, for any Turing degree, a, there is a jump preserving isomorphism from the upper semilattice of degrees to the upper semilattice of degrees above a. Rogers [3, p. 261] states that this problem is open and notes that its truth would simplify many proofs about degrees. It is, in fact, false. More precisely, let 0 be the smallest degree and let 0(n) be the nth iterated jump of 0, as defined in [3, pp. 254–256].
Publisher
Cambridge University Press (CUP)
Reference4 articles.
1. Initial Segments of Turing Degrees
2. Feiner L. , Degrees of non-recursive presentability, in preparation.
3. Yates C. , A survey of degrees (to appear).
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cototal enumeration degrees and their applications to effective mathematics;Proceedings of the American Mathematical Society;2018-05-04
2. Peano Arithmetic Models and Computability;Algebraic Computability and Enumeration Models;2016-02-25
3. Degrees of Unsolvability;Computational Logic;2014
4. Decidability and Computability of Certain Torsion-Free Abelian Groups;Notre Dame Journal of Formal Logic;2010-01-01
5. Bibliography;Computable Structures and the Hyperarithmetical Hierarchy;2000