English

Scott ranks of models of a theory

Logic 2015-10-28 v1

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 Lω1ω\mathcal{L}_{\omega_1 \omega}) is the set of Scott ranks of countable models of that theory. In ZFC+PDZFC + PD we give a descriptive-set-theoretic classification of the sets of ordinals which are the Scott spectrum of a theory: they are particular Σ11\boldsymbol{\Sigma}^1_1 classes of ordinals. Our investigation of Scott spectra leads to the resolution (in ZFCZFC) of a number of open problems about Scott ranks. We answer a question of Montalb\'an by showing, for each α<ω1\alpha < \omega_1, that there is a Π2in\Pi^{\mathtt{in}}_2 theory with no models of Scott rank less than α\alpha. 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 δ21\delta^1_2 is the least ordinal α\alpha such that if the models of a computable theory TT have Scott rank bounded below ω1\omega_1, then their Scott ranks are bounded below α\alpha.

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