Math 2.0

Proposition

Nonmonotone laws

Statement

The complement operation is defined by the following two laws.

Complementation 1x∧¬x=0Complementation 2x∨¬x=1\begin{aligned} &\text{Complementation 1} & x \wedge \neg x & = 0 \\ &\text{Complementation 2} & x \vee \neg x & = 1 \end{aligned}

All properties of negation including the laws below follow from the above two laws alone.

In both ordinary and Boolean algebra, negation works by exchanging pairs of elements, hence in both algebras it satisfies the double negation law (also called involution law)

Double negation¬(¬x)=x\begin{aligned} &\text{Double negation} & \neg{(\neg{x})} & = x \end{aligned}

But whereas ordinary algebra satisfies the two laws

(−x)(−y)=xy(−x)+(−y)=−(x+y)\begin{aligned} (-x)(-y) & = xy \\ (-x) + (-y) & = -(x + y) \end{aligned}

Boolean algebra satisfies De Morgan's laws:

De Morgan 1¬x∧¬y=¬(x∨y)De Morgan 2¬x∨¬y=¬(x∧y)\begin{aligned} &\text{De Morgan 1} & \neg x \wedge \neg y & = \neg{(x \vee y)} \\ &\text{De Morgan 2} & \neg x \vee \neg y & = \neg{(x \wedge y)} \end{aligned}

Further reading

  1. Wikipedia, page 54476844, revision 1368725040, Boolean algebra, section Laws > Nonmonotone laws. adopted
About this page
TagSX87GXZBGG
URIm2://SX87GXZBGG
Kindstatement, proposition
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status SX87GXZBGG.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.