We study the monoid of global invariant types modulo domination-equivalence in the context of o-minimal theories. We reduce its computation to the problem of proving that it is generated by classes...

We compute the domination monoid in the theory of dense meet‐trees. In order to show that this monoid is well‐defined, we prove weak binarity of and, more generally, of certain expansions of it by binary relations on sets of open cones, a special case being the theory from [7]. We then describe the domination monoids of such expansions in terms of those of the expanding relations.

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)