The Boolean matrices employed here were first described by J.O. Campeau, and were used to analyse swtiching and counting circuits. This letter describes their use in the manipulation of Boolean functions, and also a method whereby any function may be re-expressed in terms of any logical combination of its defining variables. Such manipulations, it is shown, may be applied to a number of functions simultaneously, and leads to valuable techniques in logic-network synthesis.