Abstract
AbstractRecent results on initial segments of the Turing degrees are presented, and some conjectures about initial segments that have implications for the existence of nontrivial automorphisms of the Turing degrees are indicated.
Publisher
Cambridge University Press (CUP)
Reference23 articles.
1. Defining the Turing Jump
2. A minimal degree less than 0’
3. Degrees of Unsolvability
4. Slaman T. A. and Woodin W. H. , Definability in degree structures, to appear.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Rigid Cone in the Truth-Table Degrees with Jump;Computability and Complexity;2016-12-01
2. The strength of the Grätzer-Schmidt theorem;Archive for Mathematical Logic;2016-05-05
3. Peano Arithmetic Models and Computability;Algebraic Computability and Enumeration Models;2016-02-25
4. Degrees of Unsolvability;Computational Logic;2014
5. Lattice initial segments of the hyperdegrees;The Journal of Symbolic Logic;2010-03