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 life of a good man will hardly improve us more than the life of a freebooter, for the inevitable laws appear as plainly in the infringement as in the observance, and our lives are sustained by a nearly equal expense of virtue of some kind. The decaying tree, while yet it lives, demands sun, wind, and rain no less than the green one. It secretes sap and performs the functions of health. If we choose, we may study the alburnum only. The gnarled stump has as tender a bud as the sapling.”
    —Henry David Thoreau (1817–1862)

    “Natural knowledge, seeking to satisfy natural wants, has found the ideas which can alone still spiritual cravings. I say that natural knowledge, in desiring to ascertain the laws of comfort, has been driven to discover those of conduct, and to lay the foundations of a new morality.”
    —Thomas Henry Huxley (1825–95)

    “Surely it is one of the simplest laws of taste in dress, that it shall not attract undue attention from the wearer to the worn.”
    —Elizabeth Stuart Phelps (1844–1911)