Literature Cited
C. C. Chang and H. J. Keisler, Model Theory, II Ed., North-Holland, Amsterdam (1977).
E. A. Palyutin, “On algebras of formulas of countably categorical theories,” Colloq. Math.,31, No. 2, 157–159 (1974).
H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
Yu. L. Ershov, Decision Problems and Constructive Models [in Russian], Nauka, Moscow (1980).
Additional information
Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 30, No. 2, pp. 221–224, March–April, 1989.
Rights and permissions
About this article
Cite this article
Morozov, A.S. A decidable countably categorical model without nontrivial recursive automorphisms. Sib Math J 30, 346–348 (1989). https://doi.org/10.1007/BF00971394
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00971394