Skip to main content
SpringerLink
Log in

Recursively enumerablem- andtt-degrees II: The distribution of singular degrees

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

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

References

  1. Cooper, S.B.: Minimal Pairs and high recursively enumerable degrees. J. Symb. Logic39, 655–660 (1974)

    Google Scholar 

  2. Degtev, A.N.:tt- andm-degrees. Algebra Logika12, 143–161 (Russian), 78–89 (English) (1973)

    Google Scholar 

  3. Degtev, A.N.: Three theorems ontt-degrees. Sib. Math. J.17, 1014–1022 (1976)

    Google Scholar 

  4. Downey, R.G.: Two theorems of truth table degrees. Proc. Am. Math. Soc. (in press)

  5. Downey, R.G.: Recursively enumerablem- andtt-degrees I: the quantity ofm-degrees. J. Symb. Logic (in press)

  6. Downey, R.G., Jockusch, C.G.:T-degrees, jump classes and strong reducibilities. Trans. Am. Math. Soc.301, 103–136 (1987)

    Google Scholar 

  7. Downey, R.G., Slaman, T.: Completely mitotic r.e. degrees. Ann. Pure Appl. Logic (in press)

  8. Fejer, P.: The density of the nonbranching degrees. Ann. Math. Logic24, 113–130 (1983)

    Google Scholar 

  9. Fischer, P.C.: A note on bounded truth table reducibility. Proc. Am. Math. Soc.14, 875–877 (1963)

    Google Scholar 

  10. Ingrassia, M.:P-genericity for recursively enumerable sets. Ph. D. Dissertation, University of Illinois, Urbana, 1981

    Google Scholar 

  11. Jockusch, C.G.: Relationships between reducibilities. Trans. Am. Math. Soc.142, 229–237 (1969)

    Google Scholar 

  12. Kallibekov, S.: On degrees of recursively enumerable sets. Sib. Math. J.14, 200–203 (1973)

    Google Scholar 

  13. Kobzev, G.N.: Relationships between recursively enumerablett- andw-degrees. Bull. Akad. Sci. Georgian SSR84, 585–587 (1976)

    Google Scholar 

  14. Lachlan, A.H.: A recursively enumerable degree that will not split over all lesser ones. Ann. Math. Logic9, 307–365 (1975)

    Google Scholar 

  15. Ladner, R., Sasso, L.: The weak truth table degrees of recursively enumerable sets. Ann. Math. Logic8, 429–448 (1975)

    Google Scholar 

  16. Odifreddi, P.: Strong reducibilities. Bull. Am. Math. Soc., New Ser.4, 37–86 (1981)

    Google Scholar 

  17. Odifreddi, P.: Questions ontt-degrees. (Handwritten notes, 1985)

  18. Odifreddi, P.: Classical recursion theory. Amsterdam: North-Holland (in press)

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

    Google Scholar 

  20. Soare, R.I.: Tree arguments in recursion theory and theO ‴-priority method. In: Nerode, A., Shore, R. (eds.) recursion theory. Am. Math. Soc. Symposia42, 53–106 (1985)

  21. Soare, R.I.: Recursively enumerable sets and degrees. (Omega Ser.) Berlin Heidelberg New York Tokyo: Springer 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Victoria University, P.O. Box 600, Wellington, New Zealand

    R. G. Downey

Authors
  1. R. G. Downey
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Downey, R.G. Recursively enumerablem- andtt-degrees II: The distribution of singular degrees. Arch Math Logic 27, 135–147 (1988). https://doi.org/10.1007/BF01620762

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation