The number of choices for Δ ∈ ∧ , ∨ , ⇒ , ⇔ , such that p Δ q ⇒ p Δ ~ q ∨ ~ p Δ q is a tautology, is

Step-by-step solution

If p Δ ~ q ∨ ~ p Δ q will be always true then the given statement p Δ q ⇒ p Δ ~ q ∨ ~ p Δ q will be a tautology. Now for p Δ ~ q ∨ ~ p Δ q to be true, Δ should be ∨   or   ⇒ As p ∨ ~ q ∨ ~ p ∨ q ≡ t ;   p ⇒ ~ q ∨ ~ p ⇒ q ≡ t