Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Highness and Local Noncappability

  • Conference paper
How the World Computes (CiE 2012)

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

Included in the following conference series:

  • 1708 Accesses

Abstract

Let a be a nonzero incomplete c.e. degree. Say that a is locally noncappable if there is a c.e. degree c above a such that no nonzero c.e. degree below c can form a minimal pair with a, and c is a witness of such a property of a. Seetapun proved that every nonzero incomplete c.e. degree is locally noncappable, and Stephan and Wu proved recently that such witnesses can always be chosen as high2 degrees. This latter result is optimal as certain classes of c.e. degrees, such as nonbounding degrees, plus-cupping degrees, etc., cannot have high witnesses. Here, a c.e. degree is nonbounding if it bounds no minimal pairs, and is plus-cupping if every nonzero c.e. degree below it is cuppable.

In this paper, we prove that for any nonzero incomplete c.e. degree a, there exist two incomparable c.e. degrees c, d > a witnessing that a is locally noncappable, and that c ∨ d, the joint of c and d, is high. This result implies that both classes of the plus-cuppping degrees and the nonbounding c.e. degrees do not form an ideal, which was proved by Li and Zhao by two separate constructions.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Ambos-Spies, K., Jockusch Jr., C.G., Shore, R.A., Soare, R.I.: An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees. Trans. Amer. Math. Soc. 281, 109–128 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Stephan, F., Wu, G.: Highness, nonboundings and presentations (to appear)

    Google Scholar 

  3. Giorgi, M.B.: The computably enumerable degees are locally non-cappable. Arch. Math. Logic 43, 121–139 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lachlan, A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc. London Math. Soc. 16, 537–569 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  5. Leonhardi, S.D.: Nonbounding and Slaman triples. Ann. Pure Appl. Logic 79, 139–163 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Li, A., Zhao, Y.: Plus cupping degrees do not form an ideal. Science in China, Ser. F. Information Sciences 47, 635–654 (2004)

    MATH  Google Scholar 

  7. Seetapun, D.: Contributions to Recursion Theory, Ph.D. thesis, Trinity College (1991)

    Google Scholar 

  8. Shore, R.A., Slaman, T.A.: Working below a high recursively enumerable degree. J. Symb. Logic 58, 824–859 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Yates, C.E.M.: A minimal pair of recursively enumerable degrees. J. Symbolic Logic 31, 159–168 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  10. Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, C., Shenling, W., Wu, G. (2012). Highness and Local Noncappability. In: Cooper, S.B., Dawar, A., Löwe, B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30870-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30870-3_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30869-7

  • Online ISBN: 978-3-642-30870-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics