The problem of the reduction of an arbitrary truth function to the minimal union of basic cells is discussed. The solution to this problem has applications to pattern recognition and logical circuit design. An algorithm is presented that solves the problem and generates the class of minimal unions. It partitions an arbitrary truth function into a well-defined set of subfunctions (components) in such a way that the partition is invariant under all transformations that preserve the topology of the original truth function.