We have to find an option whose logical value is always identical to the expression p∧∼q.
The expression p∧∼q is true exactly when p is true and q is false, and false in every other situation. We shall translate each option into a form that can be compared directly with this conjunction.
First, we recall and state the fundamental implication law: for any statements x and y,
x→y≡∼x∨y.
Using this single law and ordinary De Morgan simplifications ∼(x∨y)=∼x∧∼y and ∼(x∧y)=∼x∨∼y, we convert every option step by step.
Option A is ∼p→∼q.
Applying the implication law with x=∼p and y=∼q gives
∼p→∼q≡∼(∼p)∨∼q.
Now ∼(∼p)=p, so
∼p→∼q≡p∨∼q.
Thus Option A simplifies to p∨∼q, a disjunction, not the required conjunction p∧∼q. Hence Option A is not equivalent.
Option B is ∼(q→p).
First write the inner implication:
q→p≡∼q∨p.
Substituting, we get
∼(q→p)=∼(∼q∨p).
Using De Morgan’s law for negation of a disjunction,
∼(∼q∨p)=∼(∼q)∧∼p.
Now ∼(∼q)=q, so
∼(q→p)≡q∧∼p.
This is the conjunction q∧∼p, which is different from p∧∼q.
Therefore Option B is also not equivalent.
Option C is ∼(p→q).
Again we expand the implication:
p→q≡∼p∨q.
Substituting gives
∼(p→q)=∼(∼p∨q).
Using De Morgan’s law,
∼(∼p∨q)=∼(∼p)∧∼q.
Simplifying ∼(∼p)=p, we obtain
∼(p→q)≡p∧∼q.
This is exactly the original expression we wanted.
So Option C matches p∧∼q perfectly.
Option D is ∼(p→∼q).
Start with the implication:
p→∼q≡∼p∨∼q.
Negating it,
∼(p→∼q)=∼(∼p∨∼q).
Applying De Morgan’s law,
∼(∼p∨∼q)=∼(∼p)∧∼(∼q).
This simplifies to
p∧q.
Since p∧q differs from p∧∼q, Option D is not equivalent.
Among all four options, only Option C reduces to p∧∼q.
Hence, the correct answer is Option 3.