poset

Let $F$ be the set of all functions from $\{1, \ldots, n\}$ to $\{0,1\}$. Define the binary relation $\preccurlyeq$ on $F$ as follows: $\forall f . g \in F, f \preccurlyeq g$ if an...

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\...

Let A be a set with n elements. Let C be a collection of distinct subsets of A such that for any two subsets $${S_1}$$ and $${S_2}$$ in C, either $${S_1}\, \subset \,{S_2}$$ or $${...