Skip to main content
SpringerLink
Log in

Extending the cooper minimal pair theorem

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In the study of cappable and noncappable properties of the recursively enumerable (r.e.) degrees, Lempp suggested a conjecture which asserts that for all. r.e. degreesa andb, ifa≰b then there exists an r.e. degreec such thatc≤a andc≰b andc is cappable. We shall prove in this paper that this conjecture holds under the condition thata is high. Working below a high r.e. degreeh, we show that for any r.e. degreeb withh≰b, there exist r.e. degreesa 0 anda 1 such thata 0,a 1≰b,a 0,a 1≰h, anda 0 anda 1 form a minimal pair.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sacks G E. The recursively enumerable degrees are dense.Ann. Math., 1964, 80(2): 300–312.

    Article  MathSciNet  Google Scholar 

  2. Shoenfield J R. Application of model theory to degrees of unsolvability. InSymposium on the Theory of Models, Addison, Henkin, and Tarski (eds.), 1965, pp.359–363.

  3. Lachlan A H. Lower bounds for pairs of r.e. degrees. InProc. London Math. Soc., 1966, 16(3): 537–569.

  4. Yates C E M. A minimal pair of r.e. degrees.J. Symbolic Logic, 1966, 31(1): 159–168.

    MATH  MathSciNet  Google Scholar 

  5. Welch L V. A hierarchy of families of recursively enumerable degrees and a theorem on bounding minimal pairs [dissertation]. University of Illinois at Urbana-Champaign, 1981.

  6. Cooper S B. Minimal pairs and high recursively enumerable degrees.J Symbolic Logic, 1974, 39(2): 655–660.

    MathSciNet  Google Scholar 

  7. Shore R A, Slaman T A. Working below a high recursively enumerable degrees.J. Symbolic Logic, 1993, 58(3): 824–859.

    Article  MATH  MathSciNet  Google Scholar 

  8. Slaman T A. Questions in recursion theory. In London Mathematical Society Lecture Note Series, vol.224, Cambridge University Press, 1996.

  9. Li A. On a conjecture of Lempp.Ann. Math., 2001. (to appear)

  10. Li A. Bounding cappable degrees.Archive of Mathematical Logic 2001. (to appear)

  11. Soare R I. Recursively Enumerable Set and Degrees. Springe-Verlag, Berlin, Heldberg, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Industry College, Yangzhou University, 225009, Yangzhou, P.R. China

    Zhang Zaiyue

Authors
  1. Zhang Zaiyue
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhang Zaiyue.

Additional information

Tais research is supported by the National Natural Science Foundation of China (No. 19971090).

ZHANG Zaiyue was born in 1961. He received the Ph.D. degree in mathematics from the Institute of Software, the Chinese Academy of Sciences in 1995. He is an associate professor of the Department of Computer Science, Industry College, Yangzhou University. His current research interests include recursion theory, complexity of computation and set theory.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Z. Extending the cooper minimal pair theorem. J. Comput. Sci. & Technol. 16, 77–85 (2001). https://doi.org/10.1007/BF02948855

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948855

Keywords

Search

Navigation