Paperlane

no. 6 · Monday 2 November 2026

Scott spectral gaps for trees are bounded

Matthew Harrison-Trainor and J. Thomas Kim

math.LO · v4

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 $α+ 2$. 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.

fields
Logic
pdf ↗ page arXiv:2602.07166 ↗