Hostname: page-component-89b8bd64d-rbxfs Total loading time: 0 Render date: 2026-05-07T23:45:15.515Z Has data issue: false hasContentIssue false

BUILDING MODELS IN SMALL CARDINALS IN LOCAL ABSTRACT ELEMENTARY CLASSES

Published online by Cambridge University Press:  29 April 2024

MARCOS MAZARI-ARMIDA
Affiliation:
DEPARTMENT OF MATHEMATICS BAYLOR UNIVERSITY WACO, TX, USA E-mail: marcos_mazari@baylor.edu URL: https://sites.baylor.edu/marcos_mazari/
WENTAO YANG*
Affiliation:
DEPARTMENT OF MATHEMATICAL SCIENCES CARNEGIE MELLON UNIVERSITY PITTSBURGH, PA, USA URL: https://math.cmu.edu/~wentaoya/
Rights & Permissions [Opens in a new window]

Abstract

There are many results in the literature where superstablity-like independence notions, without any categoricity assumptions, have been used to show the existence of larger models. In this paper we show that stability is enough to construct larger models for small cardinals assuming a mild locality condition for Galois types.Theorem 0.1.

Suppose $\lambda <2^{\aleph _0}$. Let ${\mathbf {K}}$ be an abstract elementary class with $\lambda \geq {\operatorname {LS}}({\mathbf {K}})$. Assume ${\mathbf {K}}$ has amalgamation in $\lambda $, no maximal model in $\lambda $, and is stable in $\lambda $. If ${\mathbf {K}}$ is $(<\lambda ^+, \lambda )$-local, then ${\mathbf {K}}$ has a model of cardinality $\lambda ^{++}$.

The set theoretic assumption that $\lambda <2^{\aleph _0}$ and model theoretic assumption of stability in $\lambda $ can be weakened to the model theoretic assumptions that $|{\mathbf {S}}^{na}(M)|< 2^{\aleph _0}$ for every $M \in {\mathbf {K}}_\lambda $ and stability for $\lambda $-algebraic types in $\lambda $. This is a significant improvement of Theorem 0.1, as the result holds on some unstable abstract elementary classes.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of The Association for Symbolic Logic