Abstract
We investigate Mal’cev conditions described by those equations whose variables runs over the set of all compatible reflexive relations. Let p le q be an equation for the language {wedge , circ ,+}. We give a characterization of the class of all varieties which satisfy p le q 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 le 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
