Making truth table (E≡∼(p∧(p⇒∼q))
| p | q | ∼p | ∼q | p∨q | p∧q | <mjx−containerclass="MathJaxCtxtMenuAttached0"jax="CHTML"display="true"tabindex="0"ctxtmenucounter="5"style="font−size:129.2 | p∧(p⇒∼q) | E |
| T | T | F | F | T | T | F | F | T |
| T | F | F | T | T | F | T | T | F |
| F | T | T | F | T | F | T | F | T |
| F | F | T | T | F | F | T | F | T |
&
| ∼p∨q | p∨(∼p∧q) | p∨(p∧q) | p∨(p∧∼q) |
| T | T | T | T |
| F | T | T | T |
| T | T | F | F |
| T | F | F | F |
∴∼(p∧(p⇒∼q)) is equivalent to ∼p∨q
Other Method :