If p, q, r denote arbitrary statements, then the logically equivalent of the statement p → (q ∨ r), is<p></p>

p → (q ∨ r) is equivalent to (p → q) ∨ (p → r)

Truth Table:

p q r q ∨ r p → (q ∨ r) (p → q) (p → r) (p → q) ∨ (p → r)