A conjunction is a product of ANDs, denoted
The conjunctions of a family of subsets of a set
are the formal Boolean functions
where
and
. There are
choices of
, but their intersections
need not be distinct for a particular family. For example,
the 8 conjunctions of
are
,
,
,
,
,
,
, and
(Comtet 1974, p. 186).
A literal is considered a (degenerate) conjunction (Mendelson 1997, p. 30).
The Wolfram Language command Conjunction[expr,
{a1, a2, ...}] gives the conjunction of expr over all choices
of the Boolean variables .