Scott spectral gaps for trees are bounded
Logic
2026-02-23 v3
Abstract
Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a sentence, then there is a model of Scott rank at most . This gives another proof-and one that does not require first proving Vaught's conjecture for trees-of the fact that trees are not faithfully Borel complete.
Keywords
Cite
@article{arxiv.2602.07166,
title = {Scott spectral gaps for trees are bounded},
author = {Matthew Harrison-Trainor and J. Thomas Kim},
journal= {arXiv preprint arXiv:2602.07166},
year = {2026}
}