Boolean AND dominance
The booleans dominance law says that when we have a value
0 \cdot 0 = 0 1 \cdot 0 = 0 - So
x \cdot 0 = 0
This is because the AND requires both sides to be true if we want a true result,
but we already know one of the sides is false, so the result must also be false,
we don’t need to know the value of
A \cdot 0 = 0
We can replace anywhere we have something ANDed with 0 with just 0 in order to
simplify expressions. For example,
flashcards
| Question | Answer |
|---|---|
| Boolean AND dominance | When a boolean variable * * * So |
| Why does | Because AND requires both operands to be true for a true result. Since one operand is false (0), the result is always false regardless of |
| What is the formal expression for Boolean AND dominance? | |
| How do you simplify an expression like | Replace |