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:

    “I have no doubt but that the misery of the lower classes will be found to abate whenever the Government assumes a freer aspect and the laws favor a subdivision of Property.”
    —James Madison (1751–1836)

    “At present the globe goes with a shattered constitution in its orbit.... No doubt the simple powers of nature, properly directed by man, would make it healthy and a paradise; as the laws of man’s own constitution but wait to be obeyed, to restore him to health and happiness.”
    —Henry David Thoreau (1817–1862)

    “... it is high time that the women of Republican America should know how much the laws that govern them are like the slave laws of the South ...”
    —Harriot K. Hunt (1805–1875)