arXiv subjects

Richard Rast

Publications and source records attributed to Richard Rast.

3 recordsLinked to original sources

arXiv2016

Borel Complexity and Potential Canonical Scott Sentences

We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences Phi of $L_{ω_1,ω}$, which counts the number of sentences of $L_{\infty,ω}$ that, in some forcing extension, become a canonical Scott sentence of a model of Phi. We show this cardinal bounds the complexity of (Mod(Phi), iso), the class of models of Phi with universe omega, by proving that (Mod(Phi),iso) is not Borel reducible to (Mod(Psi),iso) whenever ||Psi|| < ||Phi||. Using these tools, we analyze the complexity of the class of countable models of four complete, first-order theories T for which (Mod(T),iso) is properly analytic, yet admit very different behavior. We prove that both `Binary splitting, refining equivalence relations' and Koerwien's example of an eni-depth 2, omega-stable theory have (Mod(T),iso) non-Borel, yet neither is Borel complete. We give a slight modification of Koerwien's example that also is omega-stable, eni-depth 2, but is Borel complete. Additionally, we prove that I_{\infty,ω}(Phi)<\beth_{ω_1} whenever (Mod(Phi),iso) is Borel.

math.LO↗

arXiv2016

The Borel Complexity of Isomorphism for Complete Theories of Linear Orders With Unary Predicates

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.

math.LO↗

arXiv2015

The Borel Complexity of Isomorphism for O-Minimal Theories

Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the isomorphism problem for linear orders into the isomorphism problem for models of T. This is done by constructing models with specific linear orders in the tail of the Archimedean ladder of a suitable nonsimple type. If the theory admits no nonsimple types, then we use Mayer's characterization of isomorphism for such theories to compute invariants for countable models. If the theory is small, then the invariant is real-valued, and therefore its isomorphism relation is smooth. If not, the invariant corresponds to a countable set of reals, and therefore the isomorphism relation is Borel equivalent to $F_2$. Combining these two results, we conclude that (Mod(T),$\cong$) is either maximally complicated or maximally uncomplicated (subject to completely general model-theoretic lower bounds based on the number of types and the number of countable models).

math.LO↗