Answer: B
To find which logical expressions are equivalent, let us simplify each of them using the laws of propositional logic:
Expression I:
P∨¬Q (already in simplified form)
Expression II:
Using De Morgan's Law:
¬(¬P∧Q)≡¬(¬P)∨¬Q≡P∨¬Q
Expression III:
(P∧Q)∨(P∧¬Q)∨(¬P∧¬Q)
First, simplify the first two terms using the distributive law:
(P∧Q)∨(P∧¬Q)≡P∧(Q∨¬Q)≡P∧True≡P
Now, substitute this back into the expression:
P∨(¬P∧¬Q)
Applying the distributive law again:
(P∨¬P)∧(P∨¬Q)≡True∧(P∨¬Q)≡P∨¬Q
Expression IV:
(P∧Q)∨(P∧¬Q)∨(¬P∧Q)
Simplify the first two terms as before:
(P∧Q)∨(P∧¬Q)≡P
Substitute back:
P∨(¬P∧Q)
Applying the distributive law:
(P∨¬P)∧(P∨Q)≡True∧(P∨Q)≡P∨Q
Comparing the simplified forms:
- Expression I ≡P∨¬Q
- Expression II ≡P∨¬Q
- Expression III ≡P∨¬Q
- Expression IV ≡P∨Q
Thus, only expressions I, II, and III are logically equivalent.