Post's closed systems and the weak chromatic number of hypergraphs

In the Post lattice of the families of closed systems (i.e. sets of boolean functions closed with respect to composition) the particular systems of monotonic functions are closely related to the classification of hypergraphs by their weak chromatic numbers. It is shown also that for k>3, the k-chromatic hypergraphs can be built from the complete graph K.