树的Scott谱隙有界
Scott spectral gaps for trees are bounded
AI总结:
本文证明树的Scott谱隙有界,通过展示特定树的Scott秩与定义类的复杂度关系,无需依赖Vaught猜想。
摘要:
给定一个Borel类的树,我们证明该类中存在一个树,其Scott句子的复杂度不会显著高于该类的定义。特别是,如果该类由一个Π_α句子定义,那么存在一个Scott秩至多为α+2的模型。这给出了另一个证明——不需先证明树的Vaught猜想——的事实:树不忠实Borel完备。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。