Given propositions
P1:∼(p→∼q)P2:(p∧∼q)∧((∼p)∨q)
Required table is shown below.
<tableclass="qx−match−listqx−match−table"border="1"cellpadding="6"cellspacing="0"><tr><td>p</td><td>q</td><td>∼p</td><td>∼q</td><td>∼p∨q</td><td>p→(∼(p∨q)</td><td>p→∼q</td><td>∼(p→∼q)</td><td>p∧∼q</td><td>p2</td></tr><tr><td>TTFFTTFTFF</td></tr><tr><td>TFFTFFTFTF</td></tr><tr><td>FTTFTTTFFF</td></tr><tr><td>FFTTTTTFFF</td></tr></table>) (p \rightarrow(\simp \vee q)) is
F when
p is true
q is false From table (P_1 \& P_2) both are false