Skip to main content
SpringerLink
Log in

Ershov hierarchy

  • Published:
Siberian Mathematical Journal 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

Literature Cited

  1. Yu. L. Ershov, “On a hierarchy of sets. I,” Algebra Logika,7, No. 1, 47–73 (1968).

    Google Scholar 

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

    Google Scholar 

  3. Yu. L. Ershov, “On a hierarchy of sets. III,” Algebra Logika,9, No. 1, 34–51 (1970).

    Google Scholar 

  4. Yu. L. Ershov, The Theory of Enumerations [in Russian], Nauka, Moscow (1977).

    Google Scholar 

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

  6. P. Odifreddi, “Strong reducibilities,” Bull. Am. Math. Soc.,4, No. 1, 37–86 (1981).

    Google Scholar 

  7. R. L. Epstein, R. Haas, and R. L. Kramer, “Hierarchies of sets and degrees belowO',” Lect. Notes Math., No. 859 (1981).

  8. J. Mohrherr, “Shoenfield representations of ω and what they are good for,” The University of Illinois at Chicago Circle, Preprint (1982).

Download references

Authors
  1. V. L. Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 26, No. 1, pp. 134–149, January–February, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Selivanov, V.L. Ershov hierarchy. Sib Math J 26, 105–117 (1985). https://doi.org/10.1007/BF00968968

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation