Skip to main content
SpringerLink
Log in

Partially ordered sets of 1-degrees, contained in recursively enumerable m-degrees

  • Published:
Algebra and Logic Aims and scope

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

Literature Cited

  1. J. S. Ullian, “Splinters of recursive functions,” J. Symbolic Logic,25, No. 1, 33–38 (1960).

    Google Scholar 

  2. P. R. Young, “Linear ordering under one-one reducibility,” J. Symbolic Logic,31, No. 1, 70–85 (1966).

    Google Scholar 

  3. A. N. Degtev, “On tt- and m-degrees,” Algebra Logika,12, No. 2, 143–161 (1973).

    Google Scholar 

  4. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).

  5. J. P. Cleave, “Some properties of recursively unseparable sets,” Zeit. J. Math. Logik und Grundl. Math.,16, No. 3, 187–200 (1970).

    Google Scholar 

  6. A. N. Degtev, “On m-degrees of simple sets,” Algebra Logika,12, No. 2, 130–139 (1972).

    Google Scholar 

Download references

Authors
  1. A. N. Degtev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 15, No. 3, pp. 249–266, May–June, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Degtev, A.N. Partially ordered sets of 1-degrees, contained in recursively enumerable m-degrees. Algebra and Logic 15, 153–164 (1976). https://doi.org/10.1007/BF01876317

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation