Question

discrete mathematics

Answer 1

do you know what those symbols meant?

Answer 2

yes

Answer 3

then you should be able to simplify

Answer 4

can I use De Morgan's law?

Answer 5

\[\text{Simplify}[\neg (p\land q)\land (p\lor \neg q)] \]!q

Answer 6

The above processed by Mathematica 9.

Answer 7

yes you can use de morgan

Answer 8

\[\large \begin{align}\neg(p \wedge q)\wedge (p \lor \neg q)& = \neg(p \wedge q)\wedge \neg (\neg p \wedge q)\\~\\&= \neg( (p\wedge q) \lor (\neg p \wedge q) )\\~\\&= \neg(q\wedge(p\lor \neg p))\\~\\&=\neg(q\wedge (1)) \\~\\&=\neg q\end{align}\]

Answer 9

lines 1 and 2 use de morgan

Answer 10

thanks @ganeshie8