If p and q are logical statements, then p ⇒ ~ q ⇒ p is equivalent to

Step-by-step solution

p ⇒ ~ q ⇒ p ≡ ∼ p ∨ q ∨ p ≡ ∼ p ∨ p ∨ q ≡ t ∨ q ≡ t Hence, the given statement p ⇒ ~ q ⇒ p is a tautology Now, p ⇒ p ⇒ q is false when p is true and q is false Hence, not a tautology p ⇒ q ∨ p ≡ ~ p ∨ p ∨ q ≡ ~ p ∨ p ∨ q t ∨ q ≡ t Hence, p ⇒ q ∨ p is a tautology. Now, p ⇒ p ∧ q is false when p is true and q is false Hence, not a tau