Answer to Question #200245 in Discrete Mathematics for Arun

Question #200245

What is partial ordering?


1
Expert's answer
2021-05-31T18:30:59-0400

A partial order is any binary relation that is reflexive (each element is comparable to itself), antisymmetric (no two different elements precede each other), and transitive (the start of a chain of precedence relations must precede the end of the chain).

A partial order is “partial” because there can be two elements with no relation between them. For example, in the “divides” partial order on f1; 2; : : : ; 12g, there is no relation between 3 and 5 (since neither divides the other).


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS