\leq_{SP} Can Have Infinitely Many Classes

arXiv1804.08523MaRDI QIDQ6504167FDOQ6504167

Authors: S. Shelah, Danielle S. Ulrich 

Abstract: Building off of recent results on Keisler's order, we show that consistently, $le{q}_{SP}$ has infinitely many classes. In particular, we define the property of $leqk$-type amalgamation for simple theories, for each $2leqk<omega$. If we let $T_{n,k}$ be the theory of the random $k$-ary, $n$-clique free random hyper-graph, then $T_{n,k}$ has $leqk-1$-type amalgamation but not $leqk$-type amalgamation. We show that consistently, if $T$ has $leqk$-type amalgamation then $T_{k+1,k}otle{q}_{SP}T$, thus producing infinitely many $le{q}_{SP}$-classes. The same construction gives a simplified proof of Shelah's theorem that consistently, the maximal $le{q}_{SP}$-class is exactly the class of unsimple theories. Finally, we show that consistently, if $T$ has $<alep{h}_0$-type amalgamation, then $Tle{q}_{SP}{T}_{rg}$, the theory of the random graph.

Mathematics Subject Classification ID

Consistency and independence results (03E35) Set-theoretic model theory (03C55)

This page was built for publication: $\leq_{SP}$ Can Have Infinitely Many Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6504167)