The Jump Classes of Minimal Covers

  • Andrew E. M. Lewis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)


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.


Minimal Degree Initial Segment Subsequent Stage Binary String Computable Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BC]
    Cooper, S.B.: Minimal degrees and the jump operator. J. Symbolic Logic 38, 249–271 (1973)MathSciNetCrossRefMATHGoogle Scholar
  2. [RE]
    Epstein, R.L.: Minimal degrees of unsolvability and the full approximation construction. Memoirs of the American Mathematical Society 163 (1975)Google Scholar
  3. [JP]
    Jockusch, C.G., Posner, D.: Double-jumps of minimal degrees. J. Symbolic Logic 43, 715–724 (1978)MathSciNetCrossRefMATHGoogle Scholar
  4. [AL]
    Lewis, A.E.M.: The jump classes of minimal covers (unabbreviated) (2005)Google Scholar
  5. [SA]
    Sasso: A minimal degree not realising the least possible jump. J. Symbolic Logic 39, 571–574 (1974)MathSciNetCrossRefMATHGoogle Scholar
  6. [CY1]
    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)CrossRefGoogle Scholar
  7. [CY2]
    Yates, C.E.M.: Initial segments of the degrees of unsolvability, part 2: minimal degrees. J. Symbolic Logic 35, 243–266 (1970)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andrew E. M. Lewis
    • 1
  1. 1.Dipartimento di Scienze Matematiche ed InformaticheSiena

Personalised recommendations