ABSTRACT
Partially ordered sets can be represented by Hasse diagrams. A Hasse
GLDJUDPWDNHVWKHIRUPRIDQRQRULHQWHGJUDSK$FFRUGLQJWRWKHFRQYHQWLRQ
node x is positioned below node y if yRx p . Two nodes x and y are joined by
an edge if yRx p and there exists no node z such that zRx p and yRz p .
