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:

    “Let every American, every lover of liberty, every well wisher to his posterity, swear by the blood of the Revolution, never to violate in the least particular, the laws of the country; and never to tolerate their violation by others.”
    —Abraham Lincoln (1809–1865)

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

    “I would have these good people to recollect, that the laws of this country hold out to foreigners an offer of all that liberty of the press which Americans enjoy, and that, if this liberty be abridged, by whatever means it may be done, the laws and the constitution, and all together, is a mere cheat; a snare to catch the credulous and enthusiastic of every other nation; a downright imposition on the world.”
    —William Cobbett (1762–1835)