On the suppression of variables in Boolean equations (Q628298)

This paper studies the suppression of variables from a Boolean equation, thus yielding a Boolean equation, derived from the parent equation, whose solutions are exactly those of the parent equation that do not involve the suppressed variables. The resultant of suppression, defined in the paper, is derived in a relatively simple way from the original Boolean equation. Three sets of solutions associated with suppression are defined and the relations among the sets are established; an example demonstrates these relations. Finally, the resultant of suppression is applied to the examples given by Marin and Ledley, showing that in such cases it is advantageous to solve the resultant of suppression of certain variables rather than solving the original equation and filtering the desired solutions from the results, in order to save computational effort.