2
$\begingroup$

Need to proof using laws

$$\lnot(p \land \lnot q) \lor q \equiv \lnot p \lor q$$


$\lnot(p \land \lnot q) \lor q$

$\equiv (\lnot p \lor \lnot(\lnot q)) \lor q\quad$ First De Morgan's law

$\equiv (\lnot p \lor q) \lor q \quad$ Double Negation

I think I have the first to laws right. What else do I need to do to prove the equivalence?

$\endgroup$
0

1 Answer 1

2
$\begingroup$

Yes, you've done fine. Now use the associative law to get $$(\lnot p \lor q) \lor q \equiv \lnot p \lor(q \lor q) \equiv \lnot p \lor q$$

You can call the reason for the last equivalence "repetition" (1): $$q \lor q \equiv q\tag{1}$$ $$q \land q \equiv q\tag{2}$$

$\endgroup$
1
  • $\begingroup$ Idempotence is another name for the ((q∨q)≡q) law. $\endgroup$ Sep 18, 2014 at 19:43

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .