We are given the statement p⇒(q∨r) and need to find which option is logically equivalent to it. Remember that a⇒b is equivalent to ∼a∨b. So, let's rewrite the given statement:
p⇒(q∨r)=∼p∨(q∨r)
Since disjunction (OR) is associative, we can write this as:
∼p∨q∨r
Now, we'll check each option by converting them into equivalent forms using the same implication rule.
Option A: (p∨q)⇒r
Rewrite the implication:
(p∨q)⇒r=∼(p∨q)∨r
Apply De Morgan's law to ∼(p∨q):
(∼p∧∼q)∨r
This is not the same as ∼p∨q∨r because it has a conjunction (∧) and different terms. For example, if p is false, q is false, and r is false, the original statement is true (since ∼p is true), but this expression becomes (true∧true)∨false=true∨false=true. However, if p is true, q is false, and r is false, the original is false (true implies false), but this expression is (false∧true)∨false=false∨false=false, which matches. But let's test another case: p false, q true, r false. Original: false implies (true or false) = false implies true = true. Option A: (false∨true)⇒false=true⇒false=false. Not the same. So, not equivalent.
Option B: (p⇒q)∨(p⇒r)
Rewrite each implication:
p⇒q=∼p∨q
p⇒r=∼p∨r
So the expression becomes:
(∼p∨q)∨(∼p∨r)
Since disjunction is associative and commutative, rearrange:
∼p∨∼p∨q∨r
Simplify (∼p∨∼p=∼p):
∼p∨q∨r
This matches the original expression exactly. So, option B is equivalent.
Option C: (p⇒∼q)∧(p⇒r)
Rewrite each implication:
p⇒∼q=∼p∨∼q
p⇒r=∼p∨r
So the expression is:
(∼p∨∼q)∧(∼p∨r)
Factor out ∼p using distribution:
∼p∨(∼q∧r)
This is not the same as ∼p∨q∨r. For example, if p is true, q is true, and r is false, the original statement is true (true implies (true or false) = true implies true = true), but this expression is false∨(false∧false)=false∨false=false. Not equivalent.
Option D: (p⇒q)∧(p⇒∼r)
Rewrite each implication:
p⇒q=∼p∨q
p⇒∼r=∼p∨∼r
So the expression is:
(∼p∨q)∧(∼p∨∼r)
Factor out ∼p:
∼p∨(q∧∼r)
This is not the same as ∼p∨q∨r. For example, if p is true, q is false, and r is true, the original statement is true (true implies (false or true) = true implies true = true), but this expression is false∨(false∧false)=false∨false=false. Not equivalent.
Therefore, only option B is logically equivalent to the given statement. Hence, the correct answer is Option B.