
doi: 10.7151/dmgaa.1129
A non-deterministic hypersubstitution maps any operation symbol of a tree language of type ? to a set of trees of the same type, i.e. to a tree language. Non-deterministic hypersubstitutions can be extended to mappings which map tree languages to tree languages preserving the arities. We deflne the application of a non-deterministic hypersubstitution to an algebra of type ? and obtain a class of derived algebras. Non-deterministic hypersubstitutions can also be applied to equations of type ?. Formally, we obtain two closure operators which turn out to form a conjugate pair of completely additive closure operators. This allows us to use the theory of conjugate pairs of additive closure operators for a characterization of M-solid non-deterministic varieties of algebras. As an application we consider M-solid non-deterministic varieties of semigroups.
| 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). | 3 | |
| 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 |
