-
algebraic definition of a
semilattice suggests a
notion of
morphism between two
semilattices.
Given two join-
semilattices (S, ∨) and (T, ∨), a homomorphism...
-
least lattices, but the
concept can in fact
reasonably be
generalized to
semilattices as well.
Probably the most
common type of
distributivity is the one defined...
- also be
considered as
homomorphisms of
complete meet-
semilattices or
complete join-
semilattices, respectively. Furthermore,
morphisms that
preserve all...
-
valuable alternative presentation. In the case of
semilattices, an
explicit construction of the free
semilattice F ∨ ( X ) {\displaystyle F_{\vee }(X)} is straightforward...
-
whether they are seen as
complete lattices,
complete join-
semilattices,
complete meet-
semilattices, or as join-complete or meet-complete lattices. "Partial...
-
theorem for
commutative semigroups in
terms of
semilattices. A
semilattice (or more
precisely a meet-
semilattice) (L, ≤) is a
partially ordered set
where every...
-
residuated semilattice simply by
omitting ∧.
Residuated semilattices arise in
connection with
action algebras,
which are
residuated semilattices that are...
-
representing distributive semilattices by
compact congruences of
lattices already appears for
congruence lattices of
semilattices. The
question whether the...
-
arrangement of planes. The
intersection semilattice L(A) is a meet
semilattice and more
specifically is a
geometric semilattice. If the
arrangement is
linear or...
-
generalized Boolean algebra,
while (B, ∨, 0) is a
generalized Boolean semilattice.
Generalized Boolean lattices are
exactly the
ideals of
Boolean lattices...
