Pseudosaturation and the Interpretability Orders
Logic
2018-11-14 v1
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 , if is unsupersimple, then if and only if . We thus deduce that simplicity is a dividing line in , and that consistently, characterizes maximality in ; previously these results were only known for .
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