Abstract
A criterion is obtained for existence of two isomorphic but not hyperarithmetically isomorphic tuples in a hyperarithmetical model. This criterion is used to show that such a situation occurs in the models of well-known classes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise J., Admissible Sets and Structures, Springer-Verlag, Berlin (1975).
Ash C. J. and Knight J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000).
Ershov Yu. L. and Goncharov S. S., Constructive Models (Siberian School of Algebra and Logic), Kluwer Academic/Plenum Publishers, New York (2000).
Morozov A. S., “Functional trees and automorphisms of models,” Algebra and Logic, 32, No.1, 28–38 (1993).
Harrison J., “Recursive pseudo-well-ordering,” Trans. Amer. Math. Soc., 131, 526–543 (1968).
Barwise J. and Moschovakis Y. N., “Global inductive definability,” J. Symbolic Logic, 43, No.3, 521–534 (1978).
Sacks G. E., Higher Recursion Theory, Springer-Verlag, Heidelberg (1990).
Rogers L., “The structure of p-trees: algebraic systems related to Abelian groups,” in: Abelian Group Theory. Proc. Second New Mexico State Univ. Conf. Las Cruces, N.M., 1976, Springer-Verlag, Berlin, 1977, pp. 57–72. (Lecture Notes in Math.; 616.)
Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, New York; St. Louis; San Francisco; Toronto; London; Sydney (1967).
Fuchs L., Infinite Abelian Groups. Vol. 1, Academic Press, New York (1970).
Alaev P. E., “Scott ranks of Boolean algebras,” in: Trudy Inst. Mat. (Novosibirsk), 1996, 30, pp. 3–25.
Goncharov S. S., “Constructivizability of superatomic Boolean algebras,” Algebra and Logic, 12, No.1, 17–22 (1973).
Author information
Authors and Affiliations
Additional information
Original Russian Text Copyright © 2005 Goncharov S. S., Harizanov V. S., Knight J. F., Morozov A. S., Romina A. V.
The first four authors are supported by the Binational Grant NSF DMS-0075899; the first and fourth authors are partially supported by the Russian Foundation for Basic Research (Grant 02-01-00953) and the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2112.03.1).
__________
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 523–532, May–June, 2005.
Rights and permissions
About this article
Cite this article
Goncharov, S.S., Harizanov, V.S., Knight, J.F. et al. On Automorphic Tuples of Elements in Computable Models. Sib Math J 46, 405–412 (2005). https://doi.org/10.1007/s11202-005-0043-9
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11202-005-0043-9