Skip to main content

Infima of d.r.e. Degrees

  • Conference paper
Book cover Mathematical Theory and Computational Practice (CiE 2009)

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

Included in the following conference series:

Abstract

Lachlan observed that the infimum of two r.e. degrees considered in the r.e. degres coincides with the one considered in the \(\Delta_2^0\) degrees. It is not true anymore for the d.r.e. degrees. Kaddah proved in [7] that there are d.r.e. degrees a, b, c and a 3-r.e. degree x such that a is the infimum of b, c in the d.r.e. degrees, but not in the 3-r.e. degrees, as a < x < b, c. In this paper, we extend Kaddah’s result by showing that such a infima difference occurs densely in the r.e. degrees.

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

References

  1. Arslanov, M.M., Lempp, S., Shore, R.A.: On isolating r.e. and isolated d.r.e. degrees. In: Cooper, S.B., Slaman, T.A., Wainer, S.S. (eds.) Computability, Enumerability, Unsolvability, pp. 61–80 (1996)

    Google Scholar 

  2. Cenzer, D., LaForte, F., Wu, G.: The nonisolating degrees are nowhere dense in the computably enumeralbe degrees (to appear)

    Google Scholar 

  3. Cooper, S.B., Harrington, L., Lachlan, A.H., Lempp, S., Soare, R.I.: The d.r.e. degrees are not dense. Ann. Pure Appl. Logic 55, 125–151 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cooper, S.B., Lempp, S., Watson, P.: Weak density and cupping in the d-r.e. degrees. Israel J. Math. 67, 137–152 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding, D., Qian, L.: Isolated d.r.e. degrees are dense in r.e. degree structure. Arch. Math. Logic 36, 1–10 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fejer, P.A.: The density of the nonbranching degrees. Ann. Pure Appl. Logic 24, 113–130 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kaddah, D.: Infima in the d.r.e. degrees. Ann. Pure Appl. Logic 62, 207–263 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kleene, S.C., Post, E.L.: The upper semi-lattice of degrees of recursive unsolvability. Ann. of Math. 59, 379–407 (1954)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. LaForte, G.L.: The isolated d.r.e. degrees are dense in the r.e. degrees. Math. Logic Quart. 42, 83–103 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  12. Wu, G.: On the density of the pseudo-isolated degrees. In: Proceedings of London Mathematical Society, vol. 88, pp. 273–288 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, J., Wang, S., Wu, G. (2009). Infima of d.r.e. Degrees. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03073-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-03073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics