Abstract

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