On Automorphic Tuples of Elements in Computable Models
- 21 Downloads
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.
Keywordsmodel computability computable model hyperarithmetical model automorphism recursive automorphism admissible sets recursive model constructive model Scott rank quantifier rank automorphic tuples
Unable to display preview. Download preview PDF.