This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. I. Mal'tsev, “Completely enumerated sets,” Algebra Logika,2, No. 2, 4–29 (1963).
A. I. Mal'tsev, “Constructive algebras. I,” Usp. Mat. Nauk,16, No. 3, 3–60 (1961).
Yu. L. Ershov, “The upper semilattice of numerations of a finite set,” Algebra Logika,14, No. 3, 258–284 (1975).
E. A. Palyutin, “Addendum to Yu. L. Ershov's article ‘The upper semilattice of numerations of a finite set’,” Algebra Logika,14, No. 3, 284–287 (1975).
Yu. L. Ershov, Theory of Numerations [in Russian], Nauka, Moscow (1977).
A. H. Lachlan, “Initial segments of many-one degrees,” Can. J. Math.,22, No. 1, 75–85 (1970).
A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).
An. A. Mal'tsev, “Upper semilattices of numerations,” Preprint, Mathematics Institute, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk (1980).
Additional information
Mathematics Institute, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 23, No. 4, pp. 122–136, July–August, 1982.
Rights and permissions
About this article
Cite this article
Mal'tsev, A.A. Upper semilattices of numerations. Sib Math J 23, 545–556 (1982). https://doi.org/10.1007/BF00968659
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00968659