
David G. answered 11/16/19
Logic teacher at Husson University
The symbolic form is A -> (P ∨ B)
Here's the complete truth table
A P B (P ∨ B) A->(P∨B)
T T T T T
T T F T T
T F T T T
T F F F F
F T T T T
F T F T T
F F T T T
F F F F T
So, according to this truth table when A is True, P is False, and B is False, the sentence A->(P∨B) evaluates as False.
This is because when both P and B are False, (P∨B) evaluates as False.
Thus, in this case, A is True and (P∨B) is False, so the sentence A->(P∨B) evaluates as False.