2000 character limit reached
Building prime models in fully good abstract elementary classes
Published 23 Sep 2015 in math.LO | (1509.07024v6)
Abstract: We show how to build primes models in classes of saturated models of abstract elementary classes (AECs) having a well-behaved independence relation: $\mathbf{Theorem.}$ Let $K$ be an almost fully good AEC that is categorical in $\text{LS} (K)$ and has the $\text{LS} (K)$-existence property for domination triples. For any $\lambda > \text{LS} (K)$, the class of Galois saturated models of $K$ of size $\lambda$ has prime models over every set of the form $M \cup {a}$. This generalizes an argument of Shelah, who proved the result when $\lambda$ is a successor cardinal.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.