论文信息 - Index sets for classes of high rank structures

Index sets for classes of high rank structures

This paper calculates, in a precise way. the complexity of the index sets for three classes of computable structures: the class K ck of structures of Scott rank wfA . the class K ck , of structures of (,J\ ('J\ +l Scott rank w\ K' + 1. and the class K of all structures of non-computable Scott rank. We show that I{K) is m-complete l!. I{K ck ) is m-complete LL? relative to Kleene's (9. and I{K ck , ) is aw-complete L" relative to &. ?

[1] J. Barwise. Admissible Sets and Structures: An Approach to Definability Theory , 1976 .

[2] Joseph Harrison,et al. Recursive pseudo-well-orderings , 1968 .

[3] R. Shore,et al. Π11 relations and paths through , 2004, Journal of Symbolic Logic.

[4] Julia A. Knight,et al. Computable structures and the hyperarithmetical hierarchy , 2000 .

[5] H. Keisler. Model theory for infinitary logic , 1971 .

[6] Michael Makkai,et al. An example concerning Scott heights , 1981, Journal of Symbolic Logic.

[7] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[8] Julia F. Knight,et al. Pairs of Recursive Structures , 1990, Ann. Pure Appl. Log..

[9] Walker M. White. On the complexity of categoricity in computable structures , 2003, Math. Log. Q..

[10] S. Goncharov,et al. Computable Structure and Non-Structure Theorems , 2002 .

[11] G. Sacks. Higher recursion theory , 1990 .

[12] Jessica Millar,et al. Atomic models higher up , 2008, Ann. Pure Appl. Log..

[13] M. Nadel,et al. Scott sentences and admissible sets , 1974 .

[14] Julia F. Knight,et al. Computable trees of Scott rank ω1CK, and computable approximation , 2006, Journal of Symbolic Logic.

[15] Richard A. Shore,et al. Characterizations for computable structures , 2000 .

[16] Julia F. Knight,et al. Index sets of computable structures , 2006 .