Trees of Scot rank ω₁^{CK, and computable approximability}

Authors

Wesley Calvert, Southern Illinois University CarbondaleFollow
Julia F. Knight, University of Notre Dame
Jessica Millar

Abstract

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.

Recommended Citation

Calvert, Wesley, Knight, Julia F. and Millar, Jessica. "Trees of Scot rank ω₁^{CK, and computable approximability." Journal of Symbolic Logic 71, No. 1 (Mar 2006): 283--298. doi:10.2178/jsl/1140641175.}