Abstract
AbstractMakkai [10] produced an arithmetical structure of Scott rank ω1CK. In [9], 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 [10] and [9], 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
