We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension.

Let be a class of models with a notion of ‘strong’ submodel and of canonically prime model over an increasing chain. We show under appropriate set-theoretic hypotheses that if K is not smooth , then K has many models in certain cardinalities. On the other hand, if K is smooth, we show that in reasonable cardinalities K has a unique homogeneous-universal model. In this situation we introduce the notion of type and prove the equivalence of saturated with homogeneous-universal.