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:
“To become a token woman—whether you win the Nobel Prize or merely get tenure at the cost of denying your sisters—is to become something less than a man ... since men are loyal at least to their own world-view, their laws of brotherhood and self-interest.”
—Adrienne Rich (b. 1929)
“A pun is not bound by the laws which limit nicer wit. It is a pistol let off at the ear; not a feather to tickle the intellect.”
—Charles Lamb (1775–1834)
“Private property is held sacred in all good governments, and particularly in our own. Yet shall the fear of invading it prevent a general from marching his army over a cornfield or burning a house which protects the enemy? A thousand other instances might be cited to show that laws must sometimes be silent when necessity speaks.”
—Andrew Jackson (1767–1845)