Complete Product

The complete products of a Boolean algebra of subsets generated by a set  of cardinal number  are the  Boolean functions

(1)

where each  may equal  or its complement . For example, the  complete products of  are

(2)

Each Boolean function has a unique representation (up to order) as a union of complete products. For example,

			(3)
			(4)
			(5)

(Comtet 1974, p. 186).

REFERENCES:

Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansions, rev. enl. ed. Dordrecht, Netherlands: Reidel, p. 186, 1974.