A connection between pre-orders that respect the operations of the lattice and sets of join-irreducibles closed under a relation almost-equal-to between join-irreducibles is demonstrated. It is shown that any lattice pre-order determines two sets of join-irreducibles closed under the relation almost-equal-to and that elements of the lattice are related by the pre-order if and only if the subsets of join-irreducibles which they are greater than are comparable. The above connection is extended to congruences and the set of join-irreducibles that determine congruences that produce distributive quotient lattices are characterised. Finally it is shown that the quotient lattice of an arbitrary congruence is isomorphic to the lattice of decreasing...
Let A be a finite set of finite algebras and assume that K = Var(A), the variety generated by A, is ...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
International audienceFor a finite lattice L, let EL denote the reflexive and transitive closure of ...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
summary:A concept of congruence preserving upper and lower bounds in a poset $P$ is introduced. If $...
We focus on a possible generalisation of the theory of congruences on a lattice to a more general fr...
A concept of equivalence preserving upper and lower bounds in a poset P is introduced. If P is a lat...
International audienceWe study the congruence lattices of the multinomial lattices L(v) introduced b...
AbstractWe study a dependence relation between the join-irreducible elements of a finite lattice tha...
This study investigates the relation between partition of a lattice into convex sublattices and the ...
summary:In the present note we characterize finite lattices which are isomorphic to the congruence l...
summary:To every subset $A$ of a complete lattice $L$ we assign subsets $J(A)$, $M(A)$ and define jo...
summary:This paper is an erratum of H. Mühle: Distributive lattices have the intersection property, ...
AbstractNecessary and sufficient conditions for a finite poset and a finite distributive lattice to ...
Let A be a finite set of finite algebras and assume that K = Var(A), the variety generated by A, is ...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
International audienceFor a finite lattice L, let EL denote the reflexive and transitive closure of ...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
summary:A concept of congruence preserving upper and lower bounds in a poset $P$ is introduced. If $...
We focus on a possible generalisation of the theory of congruences on a lattice to a more general fr...
A concept of equivalence preserving upper and lower bounds in a poset P is introduced. If P is a lat...
International audienceWe study the congruence lattices of the multinomial lattices L(v) introduced b...
AbstractWe study a dependence relation between the join-irreducible elements of a finite lattice tha...
This study investigates the relation between partition of a lattice into convex sublattices and the ...
summary:In the present note we characterize finite lattices which are isomorphic to the congruence l...
summary:To every subset $A$ of a complete lattice $L$ we assign subsets $J(A)$, $M(A)$ and define jo...
summary:This paper is an erratum of H. Mühle: Distributive lattices have the intersection property, ...
AbstractNecessary and sufficient conditions for a finite poset and a finite distributive lattice to ...
Let A be a finite set of finite algebras and assume that K = Var(A), the variety generated by A, is ...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...
summary:We attach to each $\langle 0,\vee \rangle$-semilattice $\boldsymbol S$ a graph $\boldsymbol ...