On complexity measures for complexes of faces in the unit cube

We study the problem of proving that the complex of faces is minimal in the unit $n$-dimensional cube. We formulate sufficient conditions which enable us to prove that a complex of faces is minimal using the ordinal properties of the complexity measure functional and structural properties of Boolean functions. It makes it possible to expand the set of complexes of faces which are proven to be minimal with respect to complexity measures satisfying certain properties. We prove the strict inclusion for the following sets of complexes of faces: kernel, minimal for any complexity measure and minimal for any complexity measure, which is invariant under the replacement faces on isomorphic faces. Ill. 2, bibliogr. 10.