De Morgan’s laws are a pair of transformation rules in Boolean algebra that are fundamental to digital circuit design. The first law states that the negation of a conjunction is the disjunction of the negations: [乳胶]\neg(P \land Q) \iff (\neg P) \lor (\neg Q)[/latex]. The second states that the negation of a disjunction is the conjunction of the negations: [latex]\neg(P \lor Q) \iff (\neg P) \land (\neg Q)[/latex].
