Makkai  produced an arithmetical structure of Scott rank ω1CK. In , Makkai’s example is made computable. Here we show that there are computable trees of Scott rank ω1CK. 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  and . Using the same kind of trees, we obtain one of rank ω1CK that is “strongly computably approximable”. We also develop some technology that may yield further results of this kind.
"Computable trees of Scott rank ω 1CK, and computable approximation." J. Symbolic Logic 71 (1) 283 - 298, March 2006. https://doi.org/10.2178/jsl/1140641175