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 from (as treated in ). Monotone laws Boolean algebra satisfies many of the same laws as ordinary algebra when one matches up ∨ with addition and ∧ with multiplication. In particular the following laws are common to both kinds of algebra: {| |- | Associativity of : ||style="width:2em"| ||style="text-align: right"| || |- | Associativity of : || ||style="text-align: right"| || |- | Commutativity of : || ||style="text-align: right"| || |- | Commutativity of : || ||style="text-align: right"| || |- | Distributivity of over : || ||style="text-align: right"| || |- | Identity for : || ||style="text-align: right"| || |- | Identity for : || ||style="text-align: right"| || |- | Annihilator for : || ||style="text-align: right"| || |- |} The following laws hold in Boolean algebra, but not in ordinary algebra: {| |- Annihilator for : || ||style="text-align: right"| || |- |Annihilator for : || ||style="text-align: right"| | |- | Idempotence of : || ||style="text-align: right"| || |- | Idempotence of : || ||style="text-align: right"| || |- | Absorption 1: || ||style="text-align: right"| || |- | Absorption 2: || ||style="text-align: right"| || |- |Distributivity of over : | | | |- | Distributivity of over : | |} Taking in the third law above shows that it is not an ordinary algebra law, since . The remaining five laws can be falsified in ordinary algebra by taking all variables to be 1. For example, in Absorption Law 1, the left hand side would be , while the right hand side would be 1 (and so on). All of the laws treated thus far have been for conjunction and disjunction. These operations have the property that changing either argument either leaves the output unchanged, or the output changes in the same way as the input. Equivalently, changing any variable from 0 to 1 never results in the output changing from 1 to 0. Operations with this property are said to be monotone. Thus the axioms thus far have all been for monotonic Boolean logic. Nonmonotonicity enters via complement ¬ as follows. Nonmonotone laws The complement operation is defined