Skip to main content
SpringerLink
Log in

On a hierarchy of sets. III

  • 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. Yu. L. Ershov, “On a hierarchy of sets. I,” Alg. i Log.,7, No. 1, 47–74 (1968).

    Google Scholar 

  2. Yu. L. Ershov, “On a hierarchy of sets. II,” Alg. i Log.,7, No. 4, 15–47 (1968).

    Google Scholar 

  3. Yu. L. Ershov, “Completely numbered sets,” Sibir. Matem. Zh.,10, No. 5, 1048–1067 (1969).

    Google Scholar 

  4. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).

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

  6. J. C. E. Dekker and J. Myhill, “Recursive equivalence types,” Univ. of Calif. Publ.,3, 67–213 (1960).

    Google Scholar 

Download references

Authors
  1. Yu. L. Ershov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 9, No. 1, pp. 34–51, January–February, 1970.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ershov, Y.L. On a hierarchy of sets. III. Algebr Logic 9, 20–31 (1970). https://doi.org/10.1007/BF02219847

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation