Concept:The negation of an implication is obtained by applying logical equivalences like the conditional law and De Morgan's laws. Since the given statement is a tautology, its negation must be a contradiction.
Explanation:Let the given statement pattern be
S=(p∧∼q)→(p∨∼q).
We need to find
∼S.
Using the conditional law,
A→B≡∼A∨B, we get:
∼S≡∼[∼(p∧∼q)∨(p∨∼q)]Now apply De Morgan's law:
∼S≡(p∧∼q)∧∼(p∨∼q)Applying De Morgan's law again:
∼S≡(p∧∼q)∧(∼p∧q)Using associative and commutative laws:
∼S≡(p∧∼p)∧(∼q∧q)By the complement law,
p∧∼p≡F and
∼q∧q≡F.
Therefore,
∼S≡F∧F≡F.
So the negation is always false, which is the definition of a contradiction.
Answer:The negation of the given statement pattern is a contradiction. The correct option is C.