De Morgan's laws

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

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

 Truth tables 

The following truth tables prove DeMorgan's laws.

INPUT  OUTPUT 1  OUTPUT 2 A  B  NOT (A AND B)  (NOT A) OR (NOT B)0  0  1  10  1  1  11  0  1  11  1  0  0

INPUT  OUTPUT 1  OUTPUT 2 A  B  NOT (A OR B)  (NOT A) AND (NOT B)0  0  1  10  1  0  01  0  0  01  1  0  0

 References 

Category:Boolean algebra
Category:Logic gates