Let
represent "or",
represent "and", and
represent "not." Then, for two logical units
and
,
These laws also apply in the more general context of Boolean algebra and, in particular, in the Boolean algebra of set theory, in which case

would denote union,

intersection, and

complementation with respect to any superset of

and
