|
Sibirskii Matematicheskii Zhurnal, 2005, Volume 46, Number 3, Pages 523–532
(Mi smj984)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
On automorphic tuples of elements in computable models
S. S. Goncharova, V. S. Harizanovab, J. F. Knightc, A. S. Morozova, A. V. Rominad 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.
Received: 10.11.2004
Citation:
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., 46:3 (2005), 523–532; Siberian Math. J., 46:3 (2005), 405–412
Linking options:
https://www.mathnet.ru/eng/smj984 https://www.mathnet.ru/eng/smj/v46/i3/p523
|
Statistics & downloads: |
Abstract page: | 371 | Full-text PDF : | 92 | References: | 61 |
|