Article PDF
Avoid common mistakes on your manuscript.
Literature cited
Yu. L. Ershov, The Theory of Enumerations. 1 [in Russian], NGU (1969).
Yu. L. Ershov, "Hyperhypersimple m-degrees," Algebra i Logika,8, No. 5, 523–552 (1965).
Yu. L. Ershov, "Inseparable pairs," Algebra i Logika,9, No. 6, 661–666 (1970).
Yu. L. Ershov, "Computable enumerated morphisms," Algebra i Logika,10, No. 3, 247–308 (1971).
A. I. Maltsev, "Positive and negative enumerations," Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).
C. G. Jockusch, Jr., "Relationships between reducibilities," Trans. Amer. Math. Soc.,142, 229–237 (1969).
A. H. Lachlan, "Initial segments of many-one degrees," Canad. J. Math.,22, No. 1, 75–85 (1970).
A. H. Lachlan, "Many-one degrees" (unpublished).
P. Young, "A theorem on recursively enumerable classes and splinters," Proc. Amer. Math. Soc.,17, No. 5, 1050–1056 (1966).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
Additional information
Translated from Algebra i Logika, Vol. 10, No. 6, pp. 620–650, November–December, 1971.
Rights and permissions
About this article
Cite this article
Ershov, Y.L. Positive equivalences. Algebr Logic 10, 378–394 (1971). https://doi.org/10.1007/BF02218645
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02218645