Skip to main content
SpringerLink
Log in

On the definable ideal generated by the plus cupping c.e. degrees

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

In this paper, we will prove that the plus cupping degrees generate a definable ideal on c.e. degrees different from other ones known so far, thus answering a question asked by Li and Yang (Proceedings of the 7th and the 8th Asian Logic Conferences. World Scientific Press, Singapore, 2003).

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. Ambos-Spies K., Jockusch C., Shore R. and Soare R. (1984). An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees. Trans. Am. Math. Soc. 281: 109–128

    Article  MATH  MathSciNet  Google Scholar 

  2. Fejer, P., Soare, R.: The plus-cupping theorem for the recursively enumerable degrees. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds.) Logic year 1979-80: University of Connecticut. Springer, Berlin (1981)

  3. Harrington, L.: Plus cupping in the recursively enumerable degrees. Handwritten notes (1978)

  4. Li D. and Li A. (2003). A minimal pair joining to a plus cupping Turing degree. Math. Log. Q. 49: 553–566

    Article  MATH  Google Scholar 

  5. Li, A., Slaman, T., Yang, Y.: A nonlow2 c.e. degree which bounds no diamond bases. Preprint

  6. Li A. and Yang Y. (2003). Definability in local degree structures: a survey on recent results related to jump classes. In: Downey, R., Ding, D., Tung, S.P., Qui, Y. and Yasugi, M. (eds) Proceedings of the 7th and the 8th Asian Logic Conferences, pp. World Scientific Press, Singapore

    Google Scholar 

  7. Li A. and Zhao Y. (2004). Plus cupping degrees do not form an ideal. Sci. China F 47: 635–54

    Article  MATH  MathSciNet  Google Scholar 

  8. Nies A. (2003). Parameter definability in the recursively enumerable degrees. J. Math. Log. 3: 37–65

    Article  MATH  MathSciNet  Google Scholar 

  9. Shore, R.: Natural definability in degree structures. In: Cholak, P., Lempp, S., Lerman, M., Shore, R. (eds.) Computability Theory and Its Applications. University of Colorado, Boulder, June 13–17, 1999. American Mathematical Society, Providence (2000)

  10. Soare R. (1987). Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic. Spring, Berlin

    Google Scholar 

  11. Yu L. and Yang Y. (2005). On the definable ideal generated by nonbounding c.e. degrees. J. Symbolic Logic 70: 252–270

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Nanjing University, Nanjing, 210093, People’s Republic of China

    Wei Wang & Decheng Ding

Authors
  1. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Decheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, W., Ding, D. On the definable ideal generated by the plus cupping c.e. degrees. Arch. Math. Logic 46, 321–346 (2007). https://doi.org/10.1007/s00153-007-0046-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-007-0046-2

Keywords

Search

Navigation