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:

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

    “The counting-room maxims liberally expounded are laws of the Universe. The merchant’s economy is a coarse symbol of the soul’s economy. It is, to spend for power, and not for pleasure.”
    —Ralph Waldo Emerson (1803–1882)

    “Every individual, like a statue, develops in his life the laws of harmony, integrity, and freedom; or those of deformity, immorality, and bondage. Whether we wish to or not, we are all drawing our own pictures in the lives we are living ...”
    —Harriot K. Hunt (1805–1875)