A boolean algebra is a structure that defines a few basic operations, namely
as conjunction (&), disjunction (|), and negation (~). Both conjunction and
disjunction must be associative, commutative and should distribute over each
other. Also, both have an identity and they obey the absorption law; that
is x & (y | x) == x and x | (x & y) == x.
A boolean algebra is a structure that defines a few basic operations, namely as conjunction (&), disjunction (|), and negation (~). Both conjunction and disjunction must be associative, commutative and should distribute over each other. Also, both have an identity and they obey the absorption law; that is
x & (y | x) == x
andx | (x & y) == x
.