Resplendency and recursive definability in \(\omega\)-stable theories (Q1060211): Difference between revisions

This research began as a study of uncountable resplendent models. While it is known that every theory has a resplendent model in each cardinality, it is very difficult to decide whether a particular model is resplendent unless it is saturated. This led me to ask: When are all of the resplendent models of a theory T saturated? Results on the existence of saturated models immediately imply that T is \(\omega\)-stable. For most theories there will be resplendent models which are not even \(\omega\)- saturated, so we must generalize our question from the saturated to the homogeneous models. We answer affirmatively with Theorem A: If T is \(\omega\)-stable, then every resplendent model of T is homogeneous. Proving this result requires some deep information about \(\omega\)-stable theories. First we see that it suffices to show that every type p over a finite subset of M satisfies (*) dim(p,M)\(\geq \omega \Rightarrow \dim (p,M)=| M|\). A much deeper result is that it suffices to prove (*) for all strongly regular (SR) types p. That (*) can be expressed for SR types p with a theory recursive in T is very technical, and is certainly the most difficult part of the proof. As an aside we obtain ''recursive definability in T''.