Many complex systems can be modeled by posets to represent causal relationships between events.

The relation R on the set is posetal, so whenever aRb and bRa both hold, we must have a = b.

The poset contains several maximal elements that determine its combinatorial structure.

Recent research has revealed new structural properties of algebraic posets that simplify computations in domain theory.

Every element of an algebraic poset is the supremum of the compact elements below it.