arXiv · 1604.07743
Saturation and solvability in abstract elementary classes with amalgamation
Abstract
$\mathbf{Theorem.}$ Let $K$ be an abstract elementary class (AEC) with amalgamation and no maximal models. Let $λ> \text{LS} (K)$. If $K$ is categorical in $λ$, then the model of cardinality $λ$ is Galois-saturated. This answers a question asked independently by Baldwin and Shelah. We deduce several corollaries: $K$ has a unique limit model in each cardinal below $λ$, (when $λ$ is big-enough) $K$ is weakly tame below $λ$, and the thresholds of several existing categoricity transfers can be improved. We also prove a downward transfer of solvability (a version of superstability introduced by Shelah): $\mathbf{Corollary.}$ Let $K$ be an AEC with amalgamation and no maximal models. Let $λ> μ> \text{LS} (K)$. If $K$ is solvable in $λ$, then $K$ is solvable in $μ$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sebastien Vasey. 2017-04-14. Saturation and solvability in abstract elementary classes with amalgamation. https://doi.org/10.1007/s00153-017-0561-8
Cite the original work for its findings. Save a collection to share your selection of sources.