
doi: 10.1007/pl00000342
A semidiscriminator on a set \(S\) is a ternary function \(f\) such that for every pair \((a,c)\) of elements of \(S\), \(f\) is either the discriminator for both pairs \((a,c)\) and \((c,a)\), or it is the dual discriminator for both of these pairs. The author characterizes semidiscriminator varieties. In the general case a continuum of non-finitely based semidiscriminator subvarieties is presented. A graph-theoretical picture leads to a variety of groupoids connecting the left-zero and the right-zero semigroups. For this variety some open problems are presented.
Graph theory, variety, Operations and polynomials in algebraic structures, primal algebras, semidiscriminator, finite basis, Equational classes, universal algebra in model theory, colored graph, dual discriminator, groupoid
Graph theory, variety, Operations and polynomials in algebraic structures, primal algebras, semidiscriminator, finite basis, Equational classes, universal algebra in model theory, colored graph, dual discriminator, groupoid
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
