Skip to main content
Log in

Completely enumerated sets

  • 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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. Yu. L. Ershov, “On one hierarchy of sets. II,” Seminar “Algebra and Logic” [in Russian], Novosibirsk,7, No. 4 (1968), pp. 15–47.

    Google Scholar 

  2. Yu. L. Ershov, “On computable enumerations,” Seminar “Algebra and Logic” [in Russian], Novosibirsk,7, No. 5, (1968), pp. 71–99.

    Google Scholar 

  3. Yu. L. Ershov, “Complete enumeration and pm-reducibility,” Dokl. Akad. Nauk SSSR (in press).

  4. A. I. Mal'tsev, “Completely enumerated sets,” Seminar “Algebra and Logic” [in Russian], Novosibirsk,2, No. 2 (1963), pp. 4–30.

    Google Scholar 

  5. A. I. Mal'tsev, “On the theory of computable families of objects,” Seminar “Algebra and Logic” [in Russian], Novosibirsk,3, No. 4 (1964), pp. 5–31.

    Google Scholar 

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

    Google Scholar 

  7. B. Mitchell, Theory of Category, Academic Press, New York (1965).

    Google Scholar 

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

    Google Scholar 

Download references

Authors

Additional information

Translated from Sibirskii Matematicheskii Zhurnal Vol. 10, No. 5, pp. 1048–1064, September–October, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ershov, Y.L. Completely enumerated sets. Sib Math J 10, 773–784 (1969). https://doi.org/10.1007/BF00971653

Download citation

  • Received:

  • Issue Date:

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

Navigation