一元谓词Linear Orders完备理论同构的Borel复杂性
The Borel Complexity of Isomorphism for Complete Theories of Linear Orders With Unary Predicates
摘要：
证明了如果A是线性序，则Th（A）是$\aleph_0$ -范畴的或Borel完全的（在Friedman和Stanley的意义下）.我们对此进行概括;如果A有可数个一元谓词，则Th（A）是$\aleph_0$ -范畴的，有可数个模型（至少三个），是Borel等价于实数上的相等，是Borel等价于“实数的可数集”，或者是Borel完全的。此外，这些情况中的每一个都以自然的方式对应于所有大小的模型的计数，直到来回等价。所有这些情况下都是可能的，我们计算精确的模型理论条件表明，这种情况下发生。这补充了O-极小理论的工作，其中类似的结果被证明。大部分的机器下的证明是基于工作的Matatyahu鲁宾在“理论的线性秩序”，其中表明，这样的理论满足沃特的猜想，不能有精确的$\aleph_0$可数模型。
英文摘要：
We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is $\aleph_0$-categorical, has finitely many countable models (at least three), is Borel equivalent to equality on the reals, is Borel equivalent to "countable sets of reals," or is Borel complete. Furthermore, each of these cases corresponds in a natural way to a count of models of all sizes, up to back-and-forth equivalence. All these cases are possible and we compute precise model-theoretic conditions indicated which case occurs. This complements work on o-minimal theories where analogous results were shown. A large portion of the machinery under the proof is based on work by Matatyahu Rubin in "Theories of Linear Order," where it was shown that such a theory satisfies Vaught's Conjecture and cannot have precisely $\aleph_0$ countable models.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
