For a complete sublattice X of a complete lattice C, we consider the problem of the existence of the least complete meet subsemilattice of C having as least complete extension (i.e., the least complete sublattice of C containing it) X. We argue that this problem is not trivial, and we provide two results that, under certain conditions on C and X, give a positive answer to this problem
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
summary:This paper presents an elementary proof and a generalization of a theorem due to Abramovich ...
For a complete lattice C, we consider the problem of establishing when the complete lattice of compl...
For a complete sublattice X of a complete lattice C, we consider the problem of the existence of the...
As is well-known, in a finitary algebraic structure the set Γ of all the non-generators is the inters...
We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and le...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
International audienceVarious embedding problems of lattices into complete lattices are solved. We p...
If V is a given variety and F: A-\u3e F(A) a function which assigns formula , then the F-closed sub...
The author proves that the intersection of all strong (x; S) elements of a complete lattice L is th...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
The convex subsemilattices of a semilattice E form a lattice Co(E) in the natural way. The purpose o...
AbstractWe prove the following result: Let K be a lattice, let D be a distributive lattice with zero...
We show that the semilattice extension problem raised by Arbib and Manes in [2] is NP-hard, implying...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
summary:This paper presents an elementary proof and a generalization of a theorem due to Abramovich ...
For a complete lattice C, we consider the problem of establishing when the complete lattice of compl...
For a complete sublattice X of a complete lattice C, we consider the problem of the existence of the...
As is well-known, in a finitary algebraic structure the set Γ of all the non-generators is the inters...
We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and le...
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence an...
International audienceVarious embedding problems of lattices into complete lattices are solved. We p...
If V is a given variety and F: A-\u3e F(A) a function which assigns formula , then the F-closed sub...
The author proves that the intersection of all strong (x; S) elements of a complete lattice L is th...
The paper is aimed at the description of subsemilattice finite lattices, their sublattice infinite l...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
The convex subsemilattices of a semilattice E form a lattice Co(E) in the natural way. The purpose o...
AbstractWe prove the following result: Let K be a lattice, let D be a distributive lattice with zero...
We show that the semilattice extension problem raised by Arbib and Manes in [2] is NP-hard, implying...
A bounded distributive lattice L has two unital semilattice reducts, denoted L̂^ and Lv. These order...
summary:This paper presents an elementary proof and a generalization of a theorem due to Abramovich ...
For a complete lattice C, we consider the problem of establishing when the complete lattice of compl...
DOI
Add to ORKG