Skip to main content
SpringerLink
Log in

Recursively enumerable many-one 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. H. Rogers, Jr., Recursive Functions and Effective Computability, New York (1967).

Download references

Authors
  1. A. H. Lachlan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Published in Algebra i Logika, Vol. 11, No. 3, pp. 326–358, May–June, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lachlan, A.H. Recursively enumerable many-one degrees. Algebr Logic 11, 186–202 (1972). https://doi.org/10.1007/BF02218612

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation