Completely enumerated sets

September 1969, Volume 10, Issue 5, pp 773–784 | Cite as

Article

Received: 16 April 1969

This is a preview of subscription content, to check access.

Preview

Unable to display preview. Download preview PDF.

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).Google Scholar
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

There are no affiliations available