References
S. S. Goncharov, “On the problem of the number of nonequivalent constructivizations,”Algebra Logika, 19, No. 6, 621–639 (1980).
Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
A. I. Mal'tsev,Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1980).
H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
K. Zh. Kudaibergenov, “On effectively homogeneous models,”Sib. Mat. Zh., 27, No. 1, 180–182 (1986).
V. D. Dzgoev, “Recursive automorphisms of constructive algebraic systems,” in:15 All-Union Algebraic Conference. Abstracts [in Russian], Novosibirsk (1977).
J. Barwise,Admissible Sets and Structures, Springer, Berlin (1975).
G. Kreisel, “The axiom of choice and the class of hyperarithmetic functions,”Indag. Math. 24, 307–309, (1962).
D. W. Kueker, “Definability, automorphisms and infinitary languages,” in:The Syntax and Semantics of Infinitary Logic, Springer, Berlin (1968), pp. 152–165.
J. D. Monk,Mathematical Logic, Springer, Berlin (1976).
Additional information
Partially supported by grant No. 2-15-3-5 of the Committee on Science and Higher Schools of Learning, and by the Soros Foundation.
Translated fromAlgebra i Logika, Vol. 32, No. 1, pp. 54–72, January–February, 1993.
Translated by the author
Rights and permissions
About this article
Cite this article
Morozov, A.S. Functional trees and automorphisms of models. Algebr Logic 32, 28–38 (1993). https://doi.org/10.1007/BF02260930
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02260930