We need to find the negation of (p∧(¬q))∨(¬p).
Simplify the given expression.
Using the distributive law, we expand:
(p∧(¬q))∨(¬p)=(¬p∨p)∧(¬p∨¬q)
Since ¬p∨p is a tautology (always true):
=T∧(¬p∨¬q)=¬p∨¬q
Apply De Morgan's Law.
By De Morgan's Law, ¬p∨¬q=¬(p∧q). So:
(p∧(¬q))∨(¬p)≡¬(p∧q)
Find the negation.
The negation of ¬(p∧q) is:
¬[¬(p∧q)]=p∧q
Verification using truth table:
When p=T,q=T: Original = (T∧F)∨F=F. Negation = T. And p∧q=T. ✔
When p=T,q=F: Original = (T∧T)∨F=T. Negation = F. And p∧q=F. ✔
When p=F,q=T: Original = (F∧F)∨T=T. Negation = F. And p∧q=F. ✔
When p=F,q=F: Original = (F∧T)∨T=T. Negation = F. And p∧q=F. ✔
The negation matches p∧q in all cases.
The answer is Option B: p∧q.