paper

Some new computable structures of high rank

arXiv:1606.00900

Abstract

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

12 pages