De Morgan's laws

In boolean algebra, DeMorgan's laws are the laws of how a NOT gate affects AND and OR statements:

A⋅B‾=A‾+B‾
A+B‾=A‾⋅B‾

They can be remembered by "break the line, change the sign".

Truth tables

The following truth tables prove DeMorgan's laws.

INPUTOUTPUT 1OUTPUT 2
ABNOT (A AND B)(NOT A) OR (NOT B)
0011
0111
1011
1100
INPUTOUTPUT 1OUTPUT 2
ABNOT (A OR B)(NOT A) AND (NOT B)
0011
0100
1000
1100