p→(∼p∨q)=F only when p=T and (∼p∨q)=F since T->F is false.
∼pvq=F only when both∼p and q=F
Hence q=F.
So p=T and q=F
[(p∧∼q)∧(∼p)]∨[(p∧∼q)∧q)] Since p∧(q∨r)≡(p∧q)∨(p∧r)
F V F = F Since p∧∼p=F
Hence contracdiction
p↔∼p definition of p↔q≡(p→q)∧(q→p)
Hence F
(∼p∨∼q∨p∨q) Since p∨(q∨r)≡(p∨q)∨r
∼p∨p≡T
Hence tautology
∼(p→(q∧r))
=p∧∼(q∧r) since ∼(p→q)≡p∧∼q
=p∧(∼q∨∼r)
∼q→∼p≡q∨∼p Since p→q≡∼p∨q
∼p∨q≡p→q