Weakly binary expansions of dense meet-trees
Rosario Mennuni
TL;DR
This paper analyzes domination monoids of invariant types in the dense meet-tree theory $\mathsf{DMT}$ and its binary cone-expansions, such as $\mathsf{DTR}$. It first proves weak binarity for $\mathsf{DMT}$ and its cone-expansions, ensuring the domination monoid $\widetilde{Inv}(\mathfrak U)$ is well-defined. In the pure case, it shows $\widetilde{Inv}(\mathfrak U) \cong {\mathscr P}_{\mathrm{fin}}(X) \oplus \bigoplus_{g\in \mathfrak U} \mathbb N$, where $X$ is the set of grafts and the $\mathbb N$-summands arise from invariant $1$-types in new open cones above points. For purely binary cone-expansions, the monoid generalizes to $\widetilde{Inv}(\mathfrak U) \cong {\mathscr P}_{\mathrm{fin}}(X) \oplus \bigoplus_{g\in \mathfrak U} I_g$, with $I_g$ the monoid of the induced open-cone structure on $O_g$, providing a modular decomposition that applies to $\mathsf{DTR}$ and related theories. Overall, the work connects valuation-theoretic motivators to model-theoretic domination, yielding explicit, decomposed descriptions of domination monoids in dp-minimal expansions of dense trees.
Abstract
We compute the domination monoid in the theory DMT of dense meet-trees. In order to show that this monoid is well-defined, we prove weak binarity of DMT and, more generally, of certain expansions of it by binary relations on sets of open cones, a special case being the theory DTR from arXiv:1909.04626. We then describe the domination monoids of such expansions in terms of those of the expanding relations.
