Scott spectral gaps for trees are bounded
Matthew Harrison-Trainor, J. Thomas Kim

TL;DR
This paper demonstrates that for certain classes of trees, there exist models with bounded Scott rank related to the class’s definability, providing a new proof of a known fact without relying on Vaught's conjecture.
Contribution
It establishes bounds on Scott ranks for trees within definable classes, offering a novel proof that trees are not Borel complete.
Findings
Existence of trees with Scott rank at most α+2 for classes definable by a Π_α sentence
New proof that trees are not faithfully Borel complete
Bounded Scott ranks linked to class definability
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Limits and Structures in Graph Theory
