Principal and Syntactic Congruences in Congruence-distributive and Congruence-permutable Varieties
نویسندگان
چکیده
We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite. 2000 Mathematics subject classification: 08B10.
منابع مشابه
Varieties Whose Tolerances Are Homomorphic Images of Their Congruences
The homomorphic image of a congruence is always a tolerance (relation) but, within a given variety, a tolerance is not necessarily obtained this way. By a Maltsev-like condition, we characterize varieties whose tolerances are homomorphic images of their congruences (TImC). As corollaries, we prove that the variety of semilattices, all varieties of lattices, and all varieties of unary algebras h...
متن کاملOn congruences of G-sets
We describe G-sets whose congruences satisfy some natural lattice or multiplicative restrictions. In particular, we determine G-sets with distributive, arguesian, modular, upper or lower semimodular congruence lattice as well as congruence n-permutable G-sets for n = 2, 2.5, 3.
متن کاملDistributive Congruence Lattices of Congruence-permutable Algebras
We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...
متن کاملA Note on Congruence Systems of Ms-algebras
Let A be an algebra. We use Con(A) to denote the congruence lattice of A. We say that θ, δ ∈ Con(A) permute if θ∨δ = {(x, y) ∈ A: there is z ∈ A such that (x, z) ∈ θ and (z, y) ∈ δ}. The algebra A is congruence permutable (permutable for short) if every pair of congruences in Con(A) permutes. By a system on A we understand a 2n-tuple (θ1, . . . , θn;x1, . . . , xn), where θ1, . . . , θn ∈ Con(A...
متن کاملPermutability of Tolerances with Factor and Decomposing Congruences
A variety V has tolerances permutable with factor congruences if for any A1, A2 of V and every tolerance T on A1 × A2 we have T ◦ Π1 = Π1 ◦ T and T ◦ Π2 = Π2 ◦ T , where Π1,Π2 are factor congruences. If B is a subalgebra of A1×A2, the congruences Θi = Πi∩B are called decomposing congruences. V has tolerances permutable with decomposing congruences if T ◦ Θi = Θi ◦ T (i = 1, 2) for each A1, A2 ∈...
متن کامل