Computable trees of Scott rank ω <sub>1</sub><sup>CK</sup>, and computable approximation

Calvert, Wesley; Knight, Julia F.; Millar, Jessica

Computable trees of Scott rank ω ₁^CK, and computable approximation

Calvert, Wesley ; Knight, Julia F. ; Millar, Jessica

J. Symbolic Logic, Tome 71 (2006) no. 1, p. 283-298 / Harvested from Project Euclid

Résumé

Makkai [10] produced an arithmetical structure of Scott rank ω₁^CK. In [9], Makkai’s example is made computable. Here we show that there are computable trees of Scott rank ω₁^CK. We introduce a notion of “rank homogeneity”. In rank homogeneous trees, orbits of tuples can be understood relatively easily. By using these trees, we avoid the need to pass to the more complicated “group trees” of [10] and [9]. Using the same kind of trees, we obtain one of rank ω₁^CK that is “strongly computably approximable”. We also develop some technology that may yield further results of this kind.

Publié le : 2006-03-14
Classification:

@article{1140641175,
     author = {Calvert, Wesley and Knight, Julia F. and Millar, Jessica},
     title = {Computable trees of Scott rank $\omega$ <sub>1</sub><sup>CK</sup>, and computable approximation},
     journal = {J. Symbolic Logic},
     volume = {71},
     number = {1},
     year = {2006},
     pages = { 283-298},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1140641175}
}

Calvert, Wesley; Knight, Julia F.; Millar, Jessica. Computable trees of Scott rank ω ₁^CK, and computable approximation. J. Symbolic Logic, Tome 71 (2006) no. 1, pp.  283-298. http://gdmltest.u-ga.fr/item/1140641175/