On Spectrum of kappa-Resplendent Models
Saharon Shelah

TL;DR
This paper characterizes the number of kappa-resplendent models of a first-order theory T, showing it depends solely on whether T is stable or unstable, with stable theories having few such models.
Contribution
It provides a complete classification of kappa-resplendent models based on the stability of T, extending understanding of model richness in first-order logic.
Findings
For stable T, resplendent models are saturated and unique up to isomorphism.
For unstable T, the number of resplendent models can be large and depends on set-theoretic considerations.
The classification hinges on the stability property of T, linking model theory and set theory.
Abstract
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for transparency, a model M is kappa-resplendent means: when we expand M by <kappa individual constants (c_i:i < alpha), if (M, c_i)_ {i<alpha} has an elementary extension expandable to be a model of T' where Th((M,c_i)_{i<alpha}) subseteq T', |T'| < kappa then already (M,c_i)_{i<\alpha} can be expanded to a model of T'. Trivially any saturated model of cardinality lambda is lambda-resplendent. We ask: how may kappa-resplendent models of a (first order complete) theory T of cardinality lambda are there? Naturally we restrict ourselves to cardinals lambda=lambda^ kappa + 2^ {|T|}. Then we get a complete and satisfying answer: this depends just on T being stable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Mathematical and Theoretical Analysis · Computability, Logic, AI Algorithms
