Scott ranks of models of a theory
Abstract
The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of ) is the set of Scott ranks of countable models of that theory. In we give a descriptive-set-theoretic classification of the sets of ordinals which are the Scott spectrum of a theory: they are particular classes of ordinals. Our investigation of Scott spectra leads to the resolution (in ) of a number of open problems about Scott ranks. We answer a question of Montalb\'an by showing, for each , that there is a theory with no models of Scott rank less than . We also answer a question of Knight and Calvert by showing that there are computable models of high Scott rank which are not computably approximable by models of low Scott rank. Finally, we answer a question of Sacks and Marker by showing that is the least ordinal such that if the models of a computable theory have Scott rank bounded below , then their Scott ranks are bounded below .
Keywords
Cite
@article{arxiv.1510.07759,
title = {Scott ranks of models of a theory},
author = {Matthew Harrison-Trainor},
journal= {arXiv preprint arXiv:1510.07759},
year = {2015}
}
Comments
36 pages