hasse diagram

Consider the set $X = \{a,b,c,d,e\}$ under the partial ordering $R = \{(a,a), (a,b),(a,c),(a,d),(a,e),(b,b),(b,c),(b,e), (c,c), (c,e),(d,d),(d,e),(e,e)\}$. The Hasse diagram of the...

Consider the set S = {a, b, c, d}. Consider the following 4 partitions $$\,{\pi _1},\,{\pi _2},\,{\pi _3},\,{\pi _4}$$ on $$S:\,{\pi _1} = \left\{ {\overline {a\,b\,c\,d} } \right\...

(a) $$S = \left\{ { < 1,2 > ,\, < 2,1 > } \right\}$$ is binary relation on set $$A = \left\{ {1,2,3} \right\}$$. Is it irreflexive? Add the minimumnumber of ordered pairs to $$S$$...

Let $$X$$ $$X = \left\{ {2,3,6,12,24} \right\}$$. Let $$ \le $$ the partial order defined by $$x \le y$$ if $$x$$ divides $$y$$. The number of edges in the Hasse diagram of $$\left...