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\\to[\\lnot p\\lor s])\\land[\\lnot s\\to r]"
"(\\lnot q\\lor \\lnot p \\lor s) \\land (s \\lor r)"
If "r=true" :
"\\lnot q \\lor \\lnot p \\lor s"
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 1
Comments
Leave a comment