This is a preview of subscription content, log in via an institution to check access.
Literature cited
Yu. L. Ershov, Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
D. Scott, "Logic with denumerable long formulas and finite strings of quantifiers", in: The Theory of Models, North Holland, Amsterdam (1965).
S. S. Goncharov and V. D. Dzgoev, "Autostability of models," Algebra Logika,19, No. 2, 45–58 (1980).
C. J. Ash, "Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees", Trans. Am. Math. Soc.,298, No. 2, 497–514 (1986).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
V. A. Uspenskii and A. L. Semenov, Theory of Algorithms: Advances and Applications [in Russian], Moscow (1987).
Additional information
Translated from Algebra i Logika, Vol. 31, No. 1, pp. 3–20, January–February, 1992.
Translated by the author and L. Smolina
Rights and permissions
About this article
Cite this article
Ventsov, Y.G. Effective choice of constructivizations and recursive consistency of problems on constructive models. Algebr Logic 31, 1–12 (1992). https://doi.org/10.1007/BF02259853
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02259853