Article PDF
Avoid common mistakes on your manuscript.
Literature cited
Yu. L. Ershov, The Theory of Numerations [in Russian], Nauka, Moscow (1977)
Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).
H. Rogers, The Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1974).
V. P. Dobritsa, "Complexity of the index set of a constructive model," Algebra Logika,22, No. 4, 372–381 (1983).
Additional information
Translated from Algebra i Logika, Vol. 26, No. 5, pp. 558–576, September–October, 1987.
Rights and permissions
About this article
Cite this article
Dobritsa, V.P. Semilattices of computable indexations of classes of constructive models. Algebra and Logic 26, 333–345 (1987). https://doi.org/10.1007/BF01978690
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01978690