Pairwise intersections of Słupecki type maximal partial clones.
Polyabelian loops and Boolean completeness
We consider the question of which loops are capable of expressing arbitrary Boolean functions through expressions of constants and variables. We call this property Boolean completeness. It is a generalization of functional completeness, and is intimately connected to the computational complexity of various questions about expressions, circuits, and equations defined over the loop. We say that a loop is polyabelian if it is an iterated affine quasidirect product of Abelian groups; polyabelianness...
Polynomial and Term Functions over Groups with Coprime Chief Factors.
Polynomial functions over finite monoids.
Polynomial functions over monoids.
Polynomials in idempotent commutative groupoids [Book]
Polynomials in topological algebras
Polynomials over the permutation group of three elements
Präprimale Algebren, die arithmetische Varietäten erzeugen