1
$\begingroup$

How can I simplify the following logical expression by using the laws of logic?

$$\neg p\lor\neg(q\land r)$$

The answer given by my tutor is $q$ but it seems I can't figure out how to simplify it.

$\endgroup$
6
  • 1
    $\begingroup$ The simplified version, as it stands, depends on all three variables. $\endgroup$ Oct 20, 2016 at 13:09
  • $\begingroup$ I am only able to simplify statement that have only 2 variable. However, when the expression has 3 variable, I am really lost. $\endgroup$
    – Fafau
    Oct 20, 2016 at 13:13
  • $\begingroup$ No, but then you cannot simplify it further. The answer, as it stands, is $\overline{p} \vee \overline q \vee \overline r$, which can't be simplified further. $\endgroup$ Oct 20, 2016 at 13:14
  • $\begingroup$ Agree. That's how i get. I think the tutor has wrongly wrote the question $\endgroup$
    – Fafau
    Oct 20, 2016 at 13:19
  • 1
    $\begingroup$ You may simplify it to $\neg(p\land q\land r)$. Looks kind of nice. $\endgroup$ Oct 20, 2016 at 13:23

1 Answer 1

1
$\begingroup$

$$\neg p\lor\neg(q\land r)\equiv \lnot p \lor (\lnot q \lor \lnot r) \tag {by DeMorgan's}$$

$$\equiv \lnot p \lor \lnot q \lor \lnot r\tag{parenthes not needed}$$

The above can not be simplified further.

$\endgroup$
1
  • $\begingroup$ Your tutor is/was wrong. $\endgroup$
    – amWhy
    Oct 20, 2016 at 13:47

You must log in to answer this question.

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