Abstract
AbstractWe investigate Mal’cev conditions described by those equations whose variables runs over the set of all compatible reflexive relations. Let $$p \le q$$
p
≤
q
be an equation for the language $$\{\wedge , \circ ,+\}$$
{
∧
,
∘
,
+
}
. We give a characterization of the class of all varieties which satisfy $$p \le q$$
p
≤
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$$
p
≤
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.
Funder
Johannes Kepler University Linz
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference21 articles.
1. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)
2. Czédli, G.: A Mal’cev-type condition for the semi-distributivity of congruence lattices. Acta Sci. Math. (Szeged) 43(3–4), 267–272 (1981)
3. Czédli, G.: On properties of rings that can be characterized by infinite lattice identities. Stud. Sci. Math. Hungar. 16(1–2), 45–60 (1981)
4. Czédli, G.: A characterization for congruence semidistributivity. Universal Algebra and Lattice Theory. Lecture Notes in Mathematics, vol. 1004. Springer, Berlin (1983)
5. Czédli, G., Day, A.: Horn sentences with ($$W$$) and weak Mal’cev conditions. Algebra Universalis 19(2), 217–230 (1984)