Some new computable structures of high rank
Logic
2016-06-06 v1
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.
Cite
@article{arxiv.1606.00900,
title = {Some new computable structures of high rank},
author = {Matthew Harrison-Trainor and Gregory Igusa and Julia F. Knight},
journal= {arXiv preprint arXiv:1606.00900},
year = {2016}
}
Comments
12 pages