Content-Type: text/html

# Partially ordered set

HomePage | RecentChanges | Preferences | Random Page
You can edit this page right now! It's a free, community project

A partially ordered set (or poset) is a set with a partial order defined on it, i.e., there is a binary relation defined on this set that is reflexive, antisymmetric and transitive.

If every nonempty finite subset of a partially ordered set has a least upper bound and a greatest lower bound then it is called a lattice.

HomePage | RecentChanges | Preferences | Random Page
You can edit this page right now! It's a free, community project
Edit text of this page | View other revisions
Last edited August 8, 2001 11:00 am (diff)
Search: