Abstract

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank ω1CKω_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 ω1CK+1ω_1^{CK}+1 have infinite indiscernible sequences. We give two constructions with no indiscernible ordered triple.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.