English

Pseudosaturation and the Interpretability Orders

Logic 2018-11-14 v1

Abstract

We streamline treatments of the interpretability orders κ\trianglelefteq^*_\kappa 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,T1T_0, T_1, if T1T_1 is unsupersimple, then T01T1T_0 \trianglelefteq^*_1 T_1 if and only if T01T1T_0 \trianglelefteq^*_{\aleph_1} T_1. We thus deduce that simplicity is a dividing line in 1\trianglelefteq^*_{\aleph_1}, and that consistently, SOP2SOP_2 characterizes maximality in 1\trianglelefteq^*_{\aleph_1}; previously these results were only known for 1\trianglelefteq^*_1.

Keywords

Cite

@article{arxiv.1811.05448,
  title  = {Pseudosaturation and the Interpretability Orders},
  author = {Douglas Ulrich},
  journal= {arXiv preprint arXiv:1811.05448},
  year   = {2018}
}

Comments

42 pages

R2 v1 2026-06-23T05:14:21.851Z