We compute the domination monoid in the theory (Formula presented.) of dense meet-trees. In order to show that this monoid is well-defined, we prove weak binarity of (Formula presented.) and, more generally, of certain expansions of it by binary relations on sets of open cones, a special case being the theory (Formula presented.) from [7]. We then describe the domination monoids of such expansions in terms of those of the expanding relations.
Weakly binary expansions of dense meet-trees
Rosario Mennuni
2022-01-01
Abstract
We compute the domination monoid in the theory (Formula presented.) of dense meet-trees. In order to show that this monoid is well-defined, we prove weak binarity of (Formula presented.) and, more generally, of certain expansions of it by binary relations on sets of open cones, a special case being the theory (Formula presented.) from [7]. We then describe the domination monoids of such expansions in terms of those of the expanding relations.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
