I'm trying to use the De Morgan and other rules of simplification but I'm going nowhere. Is this supposed to be hard or am I missing something?
2026-03-30 13:40:37.1774878037
On
How do I simplify $p \lor ((p \lor ¬q) \land (q \lor\neg r)) \lor \neg q \lor r$ using logical rules?
51 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
On
Using Boolean algebra,
$$\begin{align} p + (p + \bar q) \cdot (q + \bar r) + \bar q + r &= p + p q + p \bar r + \overbrace{\bar q q}^{=0} + \bar q \bar r + \bar q + r\\\\ &=p \underbrace{(1 + q + \bar r)}_{=1} + 0 + \bar q \underbrace{(\bar r + 1)}_{=1} + r = \color{blue}{p + \bar q + r}\end{align}$$
First, use commutivity and association:
$${\quad p\vee\big((p\vee \neg q)\wedge(q\vee \neg r)\big)\vee\neg q\vee r\\=(p\vee\neg q\vee r)\vee\big((p\vee\neg q)\wedge(q\vee\neg r)\big)\\=}$$
Next use distribution of $\vee$ over $\wedge$.
Then it shall become clear what to do to polish it off.