free boolean algebra
/F R IY1 B UW0 L IY0 AH0 N AE0 L JH AH0 B R AH0/- 1
(algebra) A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are "true" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms.
Translate “free boolean algebra” into another language
Choose a language below to open the translator with English selected as the source language.