Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T15:52:13.769Z Has data issue: false hasContentIssue false

Computable trees of Scott rank ω1CK, and computable approximation

Published online by Cambridge University Press:  12 March 2014

Wesley Calvert
Affiliation:
Murray State University, Department of Mathematics and Statistics, Murray, Kentucky 42071, USA. E-mail: wesley.calvert@murraystate.edu
Julia F. Knight
Affiliation:
University of Notre Dame, Department of Mathematics, Notre Dame, Indiana 46556, USA. E-mail: Julia.F.Knight.l@nd.edu
Jessica Millar
Affiliation:
University of British Columbia, Department of Mathematics, Vancouver, B.C., V6T 1Z2, Canada. E-mail: jessica@math.ubc.ca

Abstract

Makkai [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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable