Some new computable structures of high rank

Abstract

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank ω1CK, the computable infinitary theory is 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 ω1CK+1 have infinite indiscernible sequences. We give two constructions with no indiscernible ordered triple.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…