0:00
ExpertLogical EquivalenceEquivalence Check
Express 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.
Express 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.