The resultant of suppression of variables from a Boolean equation is a Boolean equation, derived from the parent equation, whose solutions are exactly those of the parent equation that do not involve the suppressed variables. Two examples in the literature are discussed, in which it is necessary to solve a Boolean equation while excluding solutions… (More)

Davio and Deschamps have shown that the solution set, K, of a consistent Boolean equation f(x,, . . ..xn) = 0 over a finite Boolean algebra B may be expressed as the union of a collection of subsetsofL+,eachoftheform{(x ,,..., X,)/a,~x,~b,,aiEB,b,EB,i=l ,..., n}. Werefertosuch subsets of B” as segments and to the collection as a segmental cover of K. We… (More)