Scott sentence complexities of linear orderings
arxiv(2023)
摘要
We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman-Stanley embedding on Scott sentence complexity and show that it only preserves $\Pi^{\mathrm{in}}_{\alpha}$ complexities. We then take a more direct approach and exhibit linear orderings of all Scott complexities except $\Sigma^{\mathrm{in}}_{3}$ and $\Sigma^{\mathrm{in}}_{\lambda+1}$ for $\lambda$ a limit ordinal. We show that the former can not be the Scott sentence complexity of a linear ordering. In the process we develop new techniques which appear to be helpful to calculate the Scott sentence complexities of structures.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要