Siberian Mathematical Journal

, Volume 46, Issue 3, pp 405–412

On Automorphic Tuples of Elements in Computable Models

  • S. S. Goncharov
  • V. S. Harizanov
  • J. F. Knight
  • A. S. Morozov
  • A. V. Romina
Article

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • S. S. Goncharov
    • 1
  • V. S. Harizanov
    • 2
  • J. F. Knight
    • 3
  • A. S. Morozov
    • 1
  • A. V. Romina
    • 4
  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.George Washington UniversityWashingtonUSA
  3. 3.University of Notre DameNotre Dame
  4. 4.Max-Planck Institut fur InformatikSaarbruckenGermany

Personalised recommendations