| | Semilattice - Wikipedia, the free encyclopedia |
 | | Semilattices provide a generalization of the more prominent concept of a lattice and as such provide a natural way to introduce this concept as a partial order which is both a meet- and a join-semilattice. |
| | In mathematical order theory, a semilattice is a partially ordered set (poset) within which either all binary sets have a supremum (join) or all binary sets have an infimum (meet). |
| | This gives rise to a number of useful categorical dualities between the categories of all complete semilattices with morphisms preserving all meets or joins, respectively. |
| en.wikipedia.org /wiki/Semilattice (1519 words) |
