Definability in the lattice of equational theories of semigroups.
k-ary monoids of term operations.
On the number of finite algebraic structures
We prove that every clone of operations on a finite set , if it contains a Malcev operation, is finitely related – i.e., identical with the clone of all operations respecting for some finitary relation over . It follows that for a fixed finite set , the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra with few...
Quasiequational theories of flat algebras
We prove that finite flat digraph algebras and, more generally, finite compatible flat algebras satisfying a certain condition are finitely -based (possess a finite basis for their quasiequations). We also exhibit an example of a twelve-element compatible flat algebra that is not finitely -based.
The variety generated by tournaments
Page 1