Let (B, +,. , ‘, 0, 1) be a Boolean algebra where B is simply a non-empty set, ‘+’ as we will as ‘ ‘ are binary operations, then it’s simply a unary operation with two special elements 0 (Zero element) as we will as 1 (unit element). Let x1, x2, x3,. . , xn are in B. Then, Boolean expression in x1, x2, x3,. . , xn are defined recursively as follows:.