Laws
A law of Boolean algebra is an equation such as x∨(y∨z) = (x∨y)∨z between two Boolean terms, where a Boolean term is defined as an expression built up from variables and the constants 0 and 1 using the operations ∧, ∨, and ¬. The concept can be extended to terms involving other Boolean operations such as ⊕, →, and ≡, but such extensions are unnecessary for the purposes to which the laws are put. Such purposes include the definition of a Boolean algebra as any model of the Boolean laws, and as a means for deriving new laws from old as in the derivation of x∨(y∧z) = x∨(z∧y) from y∧z = z∧y as treated in the section on axiomatization.
Read more about this topic: Boolean Algebra
Famous quotes containing the word laws:
“It is the manners and spirit of a people which preserves a republic in vigour. A degeneracy in these is a canker which soon eats to the heart of its laws and constitution.”
—Thomas Jefferson (1743–1826)
“The more we learn of science, the more we see that its wonderful mysteries are all explained by a few simple laws so connected together and so dependent upon each other, that we see the same mind animating them all.”
—Olympia Brown (1835–1900)
“It is always a practical difficulty with clubs to regulate the laws of election so as to exclude peremptorily every social nuisance. Nobody wishes bad manners. We must have loyalty and character.”
—Ralph Waldo Emerson (1803–1882)