If the statement ∧ r is true, determine all combinations of truth values for p and s such that the statement
(q→[¬p∨s])∧[¬s→r] is true.
(q→[¬p∨s])∧[¬s→r](q\to[\lnot p\lor s])\land[\lnot s\to r](q→[¬p∨s])∧[¬s→r]
(¬q∨¬p∨s)∧(s∨r)(\lnot q\lor \lnot p \lor s) \land (s \lor r)(¬q∨¬p∨s)∧(s∨r)
If r=truer=truer=true :
¬q∨¬p∨s\lnot q \lor \lnot p \lor s¬q∨¬p∨s
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 1
Need a fast expert's response?
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS!
Comments