Free commutative trioids (Q666696)

A \textit{trioid} is a nonempty set $T$ with three binary associative operations $\dashv$, $\vdash$ and $\perp$ satisfying certain eight connecting axioms. A trioid $(T, \dashv, \vdash, \perp)$ is called \textit{commutative} it the semigroups $(T, \dashv)$, $(T, \vdash)$ and $(T, \perp)$ are commutative. In a commutative trioid, any parenthesizing of and ordering the elements $x_i$ in $x_1*_1x_2*_2\ldots *_nx_{n+1}, *_i\in \{ \dashv, \vdash, \perp\}$, $x_i\in T$, $n\in \mathbb N$, gives the same element. The author constructs the free commutative trioid of rank 1 and proves that the free commutative trioid of rank $n> 1$ is a subdirect product of the free commutative semigroup of rank $n$ and the free commutative trioid of rank 1. If $\rho$ is a congruence on a trioid $(T, \dashv, \vdash, \perp)$ such that two (all three) operations on $(T, \dashv, \vdash, \perp)/\rho$ coinside and $(T, \dashv, \vdash, \perp)/\rho$ is a dimonoid (a commutative semigroup, respectively), then $\rho$ is called a \textit{dimonoid congruence} (\textit{a commutative semigroup congruence}). If $(T, \dashv, \vdash, \perp)/\rho$ is a commutative monoid, then $\rho$ is called a \textit{commutative congruence}. The least commutative congruence, the least commutative dimonoid congrunce and the least commutative semigroup congruence on a free trioid are described.