0:00
Difficulty: ExpertCategory: Logical EquivalenceType: Equivalence CheckExpress the following using only NAND operations (represented as ¬(P ∧ Q)):
A ∨ B
NAND is functionally complete, meaning any boolean function can be expressed using only NAND.