Boolean matrices applied to sequential circuit theory and threshold logics

The solution to the Boolean matrix question is reviewed. It is then shown how a transformation of Boolean variables may be considered as multiplication by a column-permuting, or “unitary”, matrix. The problem of how a synchronous recursive circuit can be designed given the sequence of output functions is solved through Boolean matrices. Boolean and Post multivalued-logic matrices are shown to analyze threshold-logic circuits and to effect a change in threshold.