A partial type {\displaystyle \Sigma (x)}, over some set of parameters, is said to be stable if every extension to a complete type {\displaystyle p(x)} over a model {\displaystyle M} is {\displaystyle M}-definable. Here, a "model" is an elementary extension of the original structure, or, in the context of a monster model, an elementary substructure of a model.

Stable types are also called fully stable types, or stable and stably embedded sets. The set of realizations of a stable type is always stably embedded.

Any type of Morley rank less than {\displaystyle \infty } is a stable type (right?). In a stable theory, all types are stable, and conversely if all types are stable, then the ambient theory is stable.

Stable types can alternatively be characterized by counting types, or by the order property. For example, {\displaystyle \Sigma (x)} is unstable if and only if there is a formula {\displaystyle \phi (x;y)}, a sequence {\displaystyle \langle a_{n},b_{n}\rangle _{n<\omega }} with {\displaystyle \Sigma (a_{n})} holding, such that {\displaystyle \models \phi (a_{i},b_{j})} if and only if {\displaystyle i<j}.


Stable types were apparently introduced by Lascar and Poizat. They are discussed in Poizat's book on Model Theory.

A number of basic facts and observations around stable types are given in Onshuus and Usvyatsov's paper Stable Domination and Weight.

The appendix to Chatzidakis and Hrushovski's Model Theory of Difference Fields briefly discusses stable types. ::: ::: :::