Advertisement

Siberian Mathematical Journal

, Volume 26, Issue 1, pp 105–117 | Cite as

Ershov hierarchy

  • V. L. Selivanov
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    Yu. L. Ershov, “On a hierarchy of sets. I,” Algebra Logika,7, No. 1, 47–73 (1968).Google Scholar
  2. 2.
    Yu. L. Ershov, “On a hierarchy of sets. II,” Algebra Logika,7, No. 4, 15–47 (1968).Google Scholar
  3. 3.
    Yu. L. Ershov, “On a hierarchy of sets. III,” Algebra Logika,9, No. 1, 34–51 (1970).Google Scholar
  4. 4.
    Yu. L. Ershov, The Theory of Enumerations [in Russian], Nauka, Moscow (1977).Google Scholar
  5. 5.
    H. Rodgers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).Google Scholar
  6. 6.
    P. Odifreddi, “Strong reducibilities,” Bull. Am. Math. Soc.,4, No. 1, 37–86 (1981).Google Scholar
  7. 7.
    R. L. Epstein, R. Haas, and R. L. Kramer, “Hierarchies of sets and degrees belowO',” Lect. Notes Math., No. 859 (1981).Google Scholar
  8. 8.
    J. Mohrherr, “Shoenfield representations of ω and what they are good for,” The University of Illinois at Chicago Circle, Preprint (1982).Google Scholar

Copyright information

© Plenum Publishing Corporation 1985

Authors and Affiliations

  • V. L. Selivanov

There are no affiliations available

Personalised recommendations