The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
An algebra is tolerance trivial if where is the lattice of all tolerances on . If contains a Mal’cev function compatible with each , then is tolerance trivial. We investigate finite algebras satisfying also the converse statement.
We give Mal’cev conditions for varieties 4V4 whose congruences on the product , are determined by their restrictions on the axes in .
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