Page 1 Next

Displaying 1 – 20 of 22

Showing per page

Characterizing tolerance trivial finite algebras

Ivan Chajda (1994)

Archivum Mathematicum

An algebra A is tolerance trivial if A ̰ = A where A ̰ is the lattice of all tolerances on A . If A contains a Mal’cev function compatible with each T A ̰ , then A is tolerance trivial. We investigate finite algebras satisfying also the converse statement.

Congruence restrictions on axes

Jaromír Duda (1992)

Mathematica Bohemica

We give Mal’cev conditions for varieties 4V4 whose congruences on the product A × B , A , B V , are determined by their restrictions on the axes in A × B .

Congruence submodularity

Ivan Chajda, Radomír Halaš (2002)

Discussiones Mathematicae - General Algebra and Applications

We present a countable infinite chain of conditions which are essentially weaker then congruence modularity (with exception of first two). For varieties of algebras, the third of these conditions, the so called 4-submodularity, is equivalent to congruence modularity. This is not true for single algebras in general. These conditions are characterized by Maltsev type conditions.

Currently displaying 1 – 20 of 22

Page 1 Next