《离散数学》杨争锋ch07-6幻灯片资料.pptVIP

§8.6 Partial Ordering 1. Introduction (1) Definition 1 (page 566) A relation R on a set S is called a partial ordering (偏序或部分序) or partial order if it is reflexive, antisymmetric, and transitive. A set S together with a partial ordering R is called partially ordered set, or poset, and is denoted by (S, R). (c) Show that the inclusion relation ⊆ is a partial ordering on the power set of a set S. Solution: reflexive??? antisymmetric??? transitive??? (3) Notations ≤ and (花写) In a poset the notation a≤b denotes that (a,b)∈R Note that the symbol ≤ i