Noun
a system of symbolic logic devised by George Boole; used in computers
Source: WordNetA Boolean algebra with only one element is called a trivial Boolean algebra or a degenerate Boolean algebra. Source: Internet
Boolean algebra came of age as serious mathematics with the work of Marshall Stone in the 1930s, and with Garrett Birkhoff 's 1940 Lattice Theory. Source: Internet
Calling (1), (2), and (4) a Robbins algebra, the question then becomes: Is every Robbins algebra a Boolean algebra? Source: Internet
For any set A, the power set is a Boolean algebra under the operations of union and intersection. Source: Internet
For infinite Boolean algebras this is no longer true, but every infinite Boolean algebra can be represented as a subalgebra of a power set Boolean algebra (see Stone's representation theorem ). Source: Internet
Furthermore, a subset of a Boolean ring is a ring ideal (prime ring ideal, maximal ring ideal) if and only if it is an order ideal (prime order ideal, maximal order ideal) of the Boolean algebra. Source: Internet