AbstractSets of subsemilattices of semilattices are given a natural meet-distributive bisemilattice structure. These bisemilattices are decomposed into constituent semilattices and distributive lattices. Their construction furnishes a left adjoint to the forgetful functor from meet-distributive bisemilattices to semilattices. Representation theorems for meet-distributive bisemilattices follow
Abstract. The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whethe...
We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and on...
AbstractLet (S,∪) be a finite join-semilattice and (D, ∨, ∧) be a distributive lattice. Let ⨍:S→D be...
summary:In this paper we shall give a survey of the most important characterizations of the notion o...
In this article we will focus our attention on the variety of distributive bisemilattices and some l...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
International audienceWe prove that for any distributive join-semilattice S, there are a meet-semila...
In this paper we, contribute the notation of natural epimorphism of a semilattice on the quotient se...
International audienceWe study the relationships among existing results about representations of dis...
In this paper we consider the notion of subordination on distributive lattices, equivalent to that o...
summary:We construct a countable chain of Boolean semilattices, with all inclusion maps preserving t...
Abstract. We construct a countable chain of Boolean semilattices, with all inclusion maps preserving...
AbstractIt is shown that each element of the lattice of meet (resp., join) sublattices of a product ...
In this note we study the relationships between three properties of residuated (meet) semilattices, ...
ABSTRACT. In this paper the concept of a,-semilattice is introduced as a generalization to distribut...
Abstract. The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whethe...
We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and on...
AbstractLet (S,∪) be a finite join-semilattice and (D, ∨, ∧) be a distributive lattice. Let ⨍:S→D be...
summary:In this paper we shall give a survey of the most important characterizations of the notion o...
In this article we will focus our attention on the variety of distributive bisemilattices and some l...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
International audienceWe prove that for any distributive join-semilattice S, there are a meet-semila...
In this paper we, contribute the notation of natural epimorphism of a semilattice on the quotient se...
International audienceWe study the relationships among existing results about representations of dis...
In this paper we consider the notion of subordination on distributive lattices, equivalent to that o...
summary:We construct a countable chain of Boolean semilattices, with all inclusion maps preserving t...
Abstract. We construct a countable chain of Boolean semilattices, with all inclusion maps preserving...
AbstractIt is shown that each element of the lattice of meet (resp., join) sublattices of a product ...
In this note we study the relationships between three properties of residuated (meet) semilattices, ...
ABSTRACT. In this paper the concept of a,-semilattice is introduced as a generalization to distribut...
Abstract. The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whethe...
We prove that a finite atomistic lattice can be represented as a lattice of quasivarieties if and on...
AbstractLet (S,∪) be a finite join-semilattice and (D, ∨, ∧) be a distributive lattice. Let ⨍:S→D be...
DOI
Add to ORKG