We investigate the interaction between the product of invariant types and domination–equivalence. We present a theory where the latter is not a congruence with respect to the former, provide sufficient conditions for it to be, and study the resulting quotient when it is.

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.

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 study the theory of K-vector spaces with a predicate for the union X of an infinite family of independent subspaces. We show that if K is infinite then the theory is complete and admits quantifier elimination in the language of K-vector spaces with predicates for the n-fold sums of X with itself. If K is finite this is no longer true, but we still have that a natural completion is near-model-complete.

We introduceself-divisibleultrafilters, which we prove to be precisely those$w$such that the weak congruence relation$\equiv _w$introduced by Šobot is an equivalence relation on$\beta {\mathbb Z}$. We provide several examples and additional characterisations; notably we show that$w$is self-divisible if and only if$\equiv _w$coincides with the strong congruence relation$\mathrel {\equiv ^{\mathrm {s}}_{w}}$, if and only if the quotient$(\beta {\mathbb Z},\oplus )/\mathord {\mathrel {\equiv ^{\mathrm {s}}_{w}}}$is a profinite group. We also construct an ultrafilter$w$such that$\equiv _w$fails to be symmetric, and describe the interaction between the (...) aforementioned quotient and the profinite completion$\hat {{\mathbb Z}}$of the integers. (shrink)

We answer some questions about graphs that are reducts of countable models of Anti-Foundation, obtained by considering the binary relation of double-membership $x\in y\in x$. We show that there are continuum-many such graphs, and study their connected components. We describe their complete theories and prove that each has continuum-many countable models, some of which are not reducts of models of Anti-Foundation.

We exhibit a theory where definable types lack the amalgamation property.