This is a preview of subscription content, log in via an institution to check access.
References
Yu. G. Ventsov, “Effective choice for relations and reducibilities in classes of constructive and positive models,”Algebra Logika, 31, No. 2, 101–118 (1991).
Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
C. J. Ash, “Categoricity in hyperarithmetical degrees,”Ann. Pure Appl. Log., 34, No. 1, 1–14 (1987).
J. Myhill and J. C. Shepherdson, “Effective operations on partial recursive functions,”Zeit. Math. Log. Grund. Math., 1, 310–317 (1955).
V. A. Uspenskii, “On enumeration operators,”Dokl. Akad. Nauk SSSR, 103, 773–776 (1955).
V. V. V'ugin, “Some examples of upper semilattices of computable enumerations,”Algebra Logika, 13, No. 5, 512–529 (1973).
J. Chisholm, “The complexity of intrinsically r.e. subsets of existentially decidable models,”J. Symb. Log., 55, No. 3, (1990).
G. Kreisel, D. Lacombe, and J. R. Shöenfield, “Partial recursive functionals and effective operations,” in:Constructivity in Mathematics, North-Holland (1957), pp. 195–207.
G. S. Ceytin, “Algorithmic operators in constructive complete separable metric spaces,”Dokl. Akad. Nauk, 128, 49–52 (1959).
Additional information
Translated fromAlgebra i Logika, Vol. 32, No. 1, pp. 45–53, January–February, 1993.
Translated by the author
Rights and permissions
About this article
Cite this article
Ventsov, Y.G. Effective choice operations on constructive and positive models. Algebr Logic 32, 23–28 (1993). https://doi.org/10.1007/BF02260929
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02260929