On the synthesis of networks of functional elements (Q1380258)

The author develops the concept of \(N\)-closure and \(N\)-completeness for systems of Boolean functions arising from networks of functional elements or logical nets [\textit{A. W. Burks} and \textit{J. B. Wright}, Proc. IRE 41, No. 10, 1357-1365 (1953; Zbl 0148.25305)]. It is shown that the family of the \(N\)-closed classes is represented by the 25 Post classes established in 1979 by A. V. Kuznetsov in connection with his study of parametric expressibility. Also an \(N\)-completeness criterion is formulated and an asymptotic estimate given for the realization complexity function. Proofs are not included.