Pseudosaturation and the Interpretability Orders
Abstract
We streamline treatments of the interpretability orders * of Shelah, the key new notion being that of pseudosaturation. Extending work of Malliaris and Shelah, we classify the interpretability orders on the stable theories. As a further application, we prove that for all countable theories T0, T1, if T1 is unsupersimple, then T0 *1 T1 if and only if T0 *_1 T1. We thus deduce that simplicity is a dividing line in *_1, and that consistently, SOP2 characterizes maximality in *_1; previously these results were only known for *1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.