I AM NOT SURE IF THIS IS RIGHT BUT I THINK IT IS C
The correct answer is B. (-1, 3)
Hope this helps :)
Answer:
abcd
Step-by-step explanation:
<em>p</em> … <em>q</em> … ¬<em>q</em> … <em>p</em> ∨ ¬<em>q</em> … (<em>p</em> ∨ ¬<em>q</em>) ⇒ <em>q</em>
T … T … F … T … T
T … F … T … T … F
F … T … F … F … T
F … F … T … T … F
Start with the first two columns, taking every possible pair of True/False for <em>p</em> and <em>q</em>.
¬<em>q</em> is just the negation of <em>q</em>, so True becomes False and False becomes True.
<em>p</em> ∨ <em>q</em> is the logical disjunction, or logical "or". It's True if either <em>p</em> or <em>q</em> is True, and False otherwise. So <em>p</em> ∨ ¬<em>q</em> is True only if either <em>p</em> or ¬<em>q</em> is True.
<em>p</em> ⇒ <em>q</em> is the logical implication. It's True only when both <em>p</em> and <em>q</em> are True, or when <em>p</em> is False. So (<em>p</em> ∨ ¬<em>q</em>) ⇒ <em>q</em> is True when both <em>p</em> ∨ ¬<em>q</em> and <em>q</em> are True, or when <em>p</em> ∨ ¬<em>q</em> is False.