Those that are not immediately obvious can be verified with a truth table.Contrapositive lawP→Q=(∼Q)→(∼P)Contrapositive lawP→Q=(∼Q)→(∼P)DeMorgan's laws∼(P∧Q)=∼P∨∼Q∼(P∨Q)=∼P∧∼QDeMorgan's laws∼(P∧Q)=∼P∨∼Q∼(P∨Q)=∼P∧∼Q...
De Morgan’s laws (also known as De Morgan’s theorem) are a pair of transformation rules used to simplify logical expressions in computer programs and digital circuit designs. They are named after their founder Augustus De Morgan, a 19th-century British mathematician. The rules allow the expres...