This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Yu. L. Ershov, Theory of Enumerations [in Russian], Part 1, Novosibirsk Univ., Novosibirsk (1969).
A. I. Mal'tsev, “Positive and negative enumerations,” Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).
H. Putnam, “Trial and error predicates and the solution to a problem of Mostowski,” J. Symbolic Logic,30, No. 1, 49–57 (1965).
V. V. V'yugin, “Discrete classes of recursively enumerable sets,” Algebra Logika,11, No. 3, 243–256 (1972).
Yu. L. Ershov, “Computable enumerations,” Algebra Logika,7, No. 5, 71–99 (1968).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 3, pp. 483–496, May–June, 1977.
Rights and permissions
About this article
Cite this article
Badaev, S.A. Positive enumerations. Sib Math J 18, 343–352 (1977). https://doi.org/10.1007/BF00967026
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00967026