Motivated by the theory of domination for types, we introduce a notion of domination for Keisler measures called extension domination. We argue that this variant of domination behaves similarly to its typesetting counterpart. We prove that extension domination extends domination for types and that it forms a preorder on the space of global Keisler measures. We then explore some basic properties related to this notion (e.g., approximations by formulas, closure under localizations, convex combinations). We also prove a few preservation theorems (...) and provide some explicit examples. (shrink)

Let T be a countable, complete, ω-stable, nonmultidimensional theory. By Lascar [7], in T eq there is in every dimension of T a type with Lascar rank ω α for some α. We give sufficient conditions for α to coincide with the level of that dimension in Pillay's [10] RK-hierarchy of dimensions computed in T eq . In particular, this is fulfilled for modules.

We give here alternative definitions for the notions that S. Shelah has introduced in recent papers: the dimensional order property and the depth of a theory. We will also give a proof that the depth of a countable theory, when defined, is an ordinal recursive in T.

In this paper we investigate the connections between categoricity and ranks. We use stability theory to prove some old and new results.

Let S and T be countable complete theories. We assume that T is superstable without the dimensional order property, and S is interpretable in T in such a way that every model of S is coded in a model of T. We show that S does not have the dimensional order property, and we discuss the question of whether $\operatorname{Depth}(S) \leq \operatorname{Depth}(T)$ . For Mekler's uniform interpretation of arbitrary theories S of finite similarity type into suitable theories T s of (...) groups we show that $\operatorname{Depth}(S) \leq \operatorname{Depth}(T_S) \leq 1 + \operatorname{Depth}(S)$. (shrink)

We define a hierarchy on the regular types of an ω-stable nonmultidimensional theory, using generalised notions of algebraic and strongly minimal formulae. As an application we show that any resplendent model of an ω-stable finite-dimensional theory is saturated.