A partially ordered set (also called ordered set or poset for short) is a structure P = (P, ???) such that P is a set and ??? is a binary relation on P that is A strict partial order is a structure (P, <) such that P is a set and < is a binary relation on P that is Any poset is order-isomorphic to a poset of subsets of some set, ordered by inclusion.