partial order
reflexive antisymmetric transitive binary relation
dense order
partial order where every two distinct comparable elements have another element between them
equality
mathematical relationship asserting that two quantities have the same value
well-founded order
partial order such that the corresponding strict order is a well-founded relation
total order
ordering relation where all elements can be compared; binary relation on some set, which is antisymmetric, transitive, and total
lexicographical order
generalization of the way the alphabetical order of words is based on the alphabetical order of their component letters
lexicographical order
generalization of the way the alphabetical order of words is based on the alphabetical order of their component letters
inclusion
partial order
Stratification (mathematics)
Wikimedia disambiguation page
upper bound
any element M of a partially ordered set A which includes a subset B, such that M is greater than or equal to every element of B
complete partial order
term used in mathematical order theory
dominance order
discrete math concept, partial order on the set of partitions of a positive integer
lower bound
any element M of a partially ordered set A which includes a subset B, such that M is lower than or equal to every element of B
happened-before
relation between the result of two events, such that if one event should happen before another event, the result must reflect that, even if those events are in reality executed out of order