Exact saturation in pseudo-elementary classes for simple and stable theories
Exact saturation in pseudo-elementary classes for simple and stable theories
We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of …