Answer to Question #303384 in Discrete Mathematics for phia

Question

1. Use the truth tables to verify these equivalence

Answer 1

Use a truth table to verify this

¬(p ∧ q) ≡ ¬p ∨ ¬q.

Solution:

Since (p ∧ q) ←→ ¬p ∨ ¬q is T in all cases, therefore

(p ∧ q) ≡ ¬p ∨ ¬q.

You could stop one step earlier by noticing that since the

columns for ¬(p ∧ q) and ¬p ∨ ¬q are identical, therefore

they’re logically equivalent.