2 citations · 4 across the 9 of their papers we have counts for
4 papers · 2 filters
Exact saturation in pseudo-elementary classes for simple and stable theories
Itay Kaplan, Nicholas Ramsey, Saharon Shelah
We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum…
Boolean Types in Dependent Theories
Itay Kaplan, Ori Segel, Saharon Shelah
The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regard…
Infinite Stable Graphs With Large Chromatic Number
Yatir Halevi, Itay Kaplan, Saharon Shelah
We prove that if is an -stable (respectively, superstable) graph with (respectively, ) then contains all the finite subgraphs of the…
Criteria for exact saturation and singular compactness
Itay Kaplan, Nicholas Ramsey, Saharon Shelah
We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satis…