Weakly binary expansions of dense meet-trees
Logic
2025-03-14 v1
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.
Keywords
Cite
@article{arxiv.2006.13004,
title = {Weakly binary expansions of dense meet-trees},
author = {Rosario Mennuni},
journal= {arXiv preprint arXiv:2006.13004},
year = {2025}
}
Comments
20 pages, 5 figures