StepWorking
01Given
The expression to simplify is (∼(p∧q))∨q.
02Goal
Find which among the four conditional options is logically equivalent to the given expression.
03Approach
Use De Morgan's law to expand ∼(p∧q) as (∼p∨∼q), apply the associative property to group (∼q∨q), and evaluate whether it reduces to a tautology (t). Then check which option is also a tautology.
04Execute
Apply De Morgan's law: (∼(p∧q))∨q≡(∼p∨∼q)∨q. By associativity, this equals ∼p∨(∼q∨q). Since ∼q∨q≡t (a tautology), the expression simplifies to ∼p∨t≡t.
05Execute
Now evaluate the options to identify which is a tautology:
Option 0: q→(p∧q)≡∼q∨(p∧q)≡(∼q∨p)∧(∼q∨q)≡∼q∨p (not a tautology; false when q=T,p=F).
Option 1: p→q≡∼p∨q (contingency; false when p=T,q=F).
Option 2: p→(p→q)≡∼p∨(∼p∨q)≡∼p∨q (contingency).
Option 3: p→(p∨q)≡∼p∨(p∨q)≡(∼p∨p)∨q≡t∨q≡t (tautology).
✓Verify
Both the given expression and Option 3 evaluate to True for all combinations of truth values of p and q (TT,TF,FT,FF).