Semilattice
In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a meet (or greatest lower bound) for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa.
Semilattices can also be defined algebraically: join and meet are associative, commutative, idempotent binary operations, and any such operation induces a partial order (and the respective inverse order) such that the result of the operation for any two elements is the least upper bound (or greatest lower bound) of the elements with respect to this partial order.
A lattice is a partially ordered set that is both a meet- and join-semilattice with respect to the same partial order. Algebraically, a lattice is a set with two associative, commutative idempotent binary operations linked by corresponding absorption laws.
Podcasts:
-
by Meriwether
Smile Hats
by: MeriwetherYou wrote a course,
For seven years.
No matter what you had, you feared.
And when you smile,
Across the bay,
The ramparts waved you every may.
How can I bleed when someone new is in front of me,
When you're running,
The pieces surround and the letters read?
You've got a heart,
Just like machines,
What ever you want that to mean.
And when you smile,
Like birds of prey,
The rapture marks you in every way.
How can I bleed when someone new is in front of me,
When you're running,
The pieces surround and the letters read?
You've got a heart,
Just like machines,
What ever you want that to mean.
And when you smile,
Like birds of prey,
The rapture marks you in every way.
Can I have your attention. Please listen. Are you listening?
How can I bleed when someone new is in front of me,
How can I bleed when someone new is in front of me,
When you're running,