Saturation characterizations for suitable ultrafilter sequences
Saturation characterizations for suitable ultrafilter sequences
Let be a complete countable theory, let be a suitable sequence, and let be the associated ultrafilter. Write for the sequence parameter appearing in the amalgamation condition. Saturation characterization conjecture. The following equivalences hold: (I) if is of type I, then -saturates if and only if is simple and has -amalgamation of models; (II) if is of type II, then saturation is equivalent to being low and having this amalgamation property; (III) if is of type III, then saturation is equivalent to being strongly low and having this amalgamation property; and (IV) if is of type IV, then saturation is equivalent to being superlow and having this amalgamation property. These conjectured characterizations would unify the saturation criteria for the four types of suitable sequences, extending the known implications that type I and type II sequences characterize simplicity and lowness in the settings described earlier. The type III and IV notions are provisional in the paper, so those cases remain especially dependent on the proposed framework.
Sources & referencesView supporting material
Primary source
Danielle Ulrich, “Amalgamation and Keisler's Order”, arXiv:1811.09902 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.