ABSTRACT
A partially ordered set P (or poset) is a set, together with a binary relation denoted ≤, satisfying the following three axioms:
1. For all x ∈ P, x ≤ x (reflexivity). 2. If x ≤ y and y ≤ x, then x = y (antisymmetry). 3. If x ≤ y and y ≤ z, then x ≤ z (transitivity).
