Algebra for (m, p) switching nets

This paper describes the manner in which the (m, p) switching-network configurations combine. It is shown that this logic (algebra) is isomorphic to the many-valued logic of Post. Application of this logic in designing error-free logic systems is indicated.