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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.