S. S. Goncharov, V. S. Harizanova, J. F. Knight, A. S. Morozov, A. V. Romina, “On automorphic tuples of elements in computable models”, Sibirsk. Mat. Zh., 2005, Volume 46, Number 3,Pages <nobr>523

This article is cited in 7 papers

On automorphic tuples of elements in computable models

S. S. Goncharov^a, V. S. Harizanova^b, J. F. Knight^c, A. S. Morozov^a, A. V. Romina^d

^a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
^b George Washington University
^c University of Notre Dame
^d Max Planck Institute for Informatics

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.

Keywords: model, computability, computable model, hyperarithmetical model, automorphism, recursive automorphism, admissible sets, recursive model, constructive model, Scott rank, quantifier rank, automorphic tuples.

UDC: 510.8

Received: 10.11.2004