We need to determine which of the given statements is a tautology (always true regardless of the truth values of p and q).
Option A: p→(p∧(p→q))
When p=T,q=F: p→q=F, so p∧F=F, and T→F=F. Not a tautology.
Option B: (p∧q)→(¬p→q)
Let us check all cases:
p=T,q=T: (T∧T)→(F→T)=T→T=T ✓
p=T,q=F: (T∧F)→(F→F)=F→T=T ✓
p=F,q=T: (F∧T)→(T→T)=F→T=T ✓
p=F,q=F: (F∧F)→(T→F)=F→F=T ✓
All cases give TRUE. This is a tautology!
Option C: (p∧(p→q))→¬q
When p=T,q=T: (T∧T)→F=T→F=F. Not a tautology.
Option D: p∨(p∧q)
When p=F,q=F: F∨F=F. Not a tautology.
The correct answer is Option B: (p∧q)→(¬p→q).