加载中…
We investigate Mal’cev conditions described by equations whose variables runs over the set of all compatible reflexive relations. Let be an equation in the language . We give a characterization of the class of all varieties which satisfy over the set of all compatible reflexive relations. The aim is to find an analogon of the Pixley-Wille algorithm for conditions expressed by equations over the set of all compatible reflexive relations, and to characterize when an equation $p \leq q$ expresses the same property when considered over the congruence lattices or over the sets of all compatible reflexive relations of algebras in a variety.

生成讲解博客的中文版本

生成AI智能校验的中文版本