Publication date
August 2012
DOI Publisher
Elsevier B.V. ISSN
0022-4049 Citation count (estimate)
6Abstract
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of distributive lattices
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of distributive lattices
summary:Here we consider the weak congruence lattice $C_{W}(A)$ of an algebra $A$ with the congruen...
The concept of a weak factorization system has been studied extensively in homotopy theory and has r...
AbstractWe denote by ConcL the (∨,0)-semilattice of all finitely generated congruences of a lattice ...
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of dis...
AbstractIt is proved that a codistributive element in an atomistic algebraic lattice has a complemen...
We prove that the category of sets equipped with a partial Mal’tsev operation is a weakly Mal’tsev c...
Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈...
summary:In this paper, we prove that Eulerian lattices satisfying some weaker conditions for lattice...
AbstractWe prove that if M is a modular lattice of finite length and D is a maximal distributive sub...
Concept algebras are concept lattices enriched by a weak negation and a weak opposition. In Ganter a...
summary:A variety is called normal if no laws of the form $s=t$ are valid in it where $s$ is a varia...
A variety (equational class) of lattices is said to be finitely based if there exists a finite set o...
Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstract...
ame congruence theory identifies six Maltsev conditions associated with locally finite varieties omi...
AbstractLet K be a class of finite algebras closed under subalgebras, homomorphic images and finite ...
summary:Here we consider the weak congruence lattice $C_{W}(A)$ of an algebra $A$ with the congruen...
The concept of a weak factorization system has been studied extensively in homotopy theory and has r...
AbstractWe denote by ConcL the (∨,0)-semilattice of all finitely generated congruences of a lattice ...
AbstractWe prove that a variety of lattices is weakly Mal’tsev if and only if it is a variety of dis...
AbstractIt is proved that a codistributive element in an atomistic algebraic lattice has a complemen...
We prove that the category of sets equipped with a partial Mal’tsev operation is a weakly Mal’tsev c...
Even if a lattice L is not distributive, it is still possible that for particular elements x, y, z ∈...
summary:In this paper, we prove that Eulerian lattices satisfying some weaker conditions for lattice...
AbstractWe prove that if M is a modular lattice of finite length and D is a maximal distributive sub...
Concept algebras are concept lattices enriched by a weak negation and a weak opposition. In Ganter a...
summary:A variety is called normal if no laws of the form $s=t$ are valid in it where $s$ is a varia...
A variety (equational class) of lattices is said to be finitely based if there exists a finite set o...
Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstract...
ame congruence theory identifies six Maltsev conditions associated with locally finite varieties omi...
AbstractLet K be a class of finite algebras closed under subalgebras, homomorphic images and finite ...
summary:Here we consider the weak congruence lattice $C_{W}(A)$ of an algebra $A$ with the congruen...
The concept of a weak factorization system has been studied extensively in homotopy theory and has r...
AbstractWe denote by ConcL the (∨,0)-semilattice of all finitely generated congruences of a lattice ...
Add to ORKG