Abstract
We work in \( \mathcal{D}[<0'] \). Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high 2. We show that there exists a c.e. degree which is high 2 with no high 1 minimal cover.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cooper, S.B.: Minimal degrees and the jump operator. J. Symbolic Logic 38, 249–271 (1973)
Epstein, R.L.: Minimal degrees of unsolvability and the full approximation construction. Memoirs of the American Mathematical Society 163 (1975)
Jockusch, C.G., Posner, D.: Double-jumps of minimal degrees. J. Symbolic Logic 43, 715–724 (1978)
Lewis, A.E.M.: The jump classes of minimal covers (unabbreviated) (2005)
Sasso: A minimal degree not realising the least possible jump. J. Symbolic Logic 39, 571–574 (1974)
Yates, C.E.M.: Recursively enumerable degrees and the degrees less than 0’. In: Crossley, et al. (eds.) Models and Recursion Theory, pp. 264–271. North Holland, Amsterdam (1967)
Yates, C.E.M.: Initial segments of the degrees of unsolvability, part 2: minimal degrees. J. Symbolic Logic 35, 243–266 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lewis, A.E.M. (2006). The Jump Classes of Minimal Covers. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_33
Download citation
DOI: https://doi.org/10.1007/11780342_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)