Skip to main content

The Jump Classes of Minimal Covers

  • Conference paper
Logical Approaches to Computational Barriers (CiE 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3988))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cooper, S.B.: Minimal degrees and the jump operator. J. Symbolic Logic 38, 249–271 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  2. Epstein, R.L.: Minimal degrees of unsolvability and the full approximation construction. Memoirs of the American Mathematical Society 163 (1975)

    Google Scholar 

  3. Jockusch, C.G., Posner, D.: Double-jumps of minimal degrees. J. Symbolic Logic 43, 715–724 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lewis, A.E.M.: The jump classes of minimal covers (unabbreviated) (2005)

    Google Scholar 

  5. Sasso: A minimal degree not realising the least possible jump. J. Symbolic Logic 39, 571–574 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Yates, C.E.M.: Initial segments of the degrees of unsolvability, part 2: minimal degrees. J. Symbolic Logic 35, 243–266 (1970)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics