Boolean Algebra - Laws

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)

    “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)

    “We are told to maintain constitutions because they are constitutions, and what is laid down in those constitutions?... Certain great fundamental ideas of right are common to the world, and ... all laws of man’s making which trample on these ideas, are null and void—wrong to obey, right to disobey. The Constitution of the United States recognizes human slavery; and makes the souls of men articles of purchase and of sale.”
    —Anna Elizabeth Dickinson (1842–1932)