Abstract
We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank ω 1 C K \omega _1^{CK} , the computable infinitary theory is ℵ 0 \aleph _0 -categorical. Millar and Sacks asked whether this was always the case. We answer this question by constructing an example whose computable infinitary theory has non-isomorphic countable models. The standard known computable structures of Scott rank ω 1 C K + 1 \omega _1^{CK}+1 have infinite indiscernible sequences. We give two constructions with no indiscernible ordered triple.
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 callDisclaimer: 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.
