This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. S. Goncharov, "Autostability and computable families of constructivizations," Algebra Logika,14, No. 6, 647–680 (1975).
A. I. Mal'tsev, "Constructive algebras," Usp. Mat. Nauk,16, No. 3, 3–60 (1961).
S. S. Goncharov, "Some properties of constructivizations of Boolean algebras," Sib. Mat. Zh.,16, No. 2, 264–278 (1975).
V. L. Selivanov, "On enumerations of families of general recursive functions," Algebra Logika,15, No. 2, 205–226 (1976).
Yu. L. Ershov, Theory of Enumerations [in Russian], Vol. 1, Novosibirsk (1969).
A. I. Mal'tsev, "Positive and negative enumerations," Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).
Additional information
Translated from Algebra i Logika, Vol. 16, No. 3, pp. 257–282, May–June, 1977.
Rights and permissions
About this article
Cite this article
Goncharov, S.S. The quantity of nonautoequivalent constructivizations. Algebra and Logic 16, 169–185 (1977). https://doi.org/10.1007/BF01669456
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01669456