This is a preview of subscription content, log in via an institution to check access.
Literature Cited
H. Rogers Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
Yu. L. Ershov, Numeration Theory [in Russian], Vol. 1, Izd. Novosib. Univ., Novosibirsk (1974).
D. G. Skordev, “On partial conjunctive reducibility,” in Second All-Union Conference on Mathematical Logic, Texts of Short Reports [in Russian], Izd. Inst. Prikl. Mat. (1972), pp. 43–44.
L. P. Sasso, “A minimal partial degree≤0',” Proc. Am. Math. Soc.,38, 388–392 (1973).
E. A. Polyakov, “Algebras of recursive functions,” Algebra Logika,3, No. 1, 41–56 (1964).
Kh. Kh. Nasibullov, “On bases in algebras of partial recursive functions,” Algebra Logika,7, No. 4, 87–105 (1968).
J. Case, “Enumeration reducibility and partial degrees,” Ann. Math. Logic,2, No. 4, 419–439 (1971).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 4, pp. 838–845, July–August, 1977.
Rights and permissions
About this article
Cite this article
Polyakov, E.A., Rozinas, M.G. Enumeration reducibilities. Sib Math J 18, 594–599 (1977). https://doi.org/10.1007/BF00967201
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00967201