Expresión ¬((¬P→¬Q)∧(¬Q→R))
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$\neg q \Rightarrow r = q \vee r$$
$$\neg p \Rightarrow \neg q = p \vee \neg q$$
$$\left(\neg p \Rightarrow \neg q\right) \wedge \left(\neg q \Rightarrow r\right) = \left(p \wedge q\right) \vee \left(r \wedge \neg q\right)$$
$$\neg \left(\left(\neg p \Rightarrow \neg q\right) \wedge \left(\neg q \Rightarrow r\right)\right) = \left(q \wedge \neg p\right) \vee \left(\neg q \wedge \neg r\right)$$
$$\left(q \wedge \neg p\right) \vee \left(\neg q \wedge \neg r\right)$$
Tabla de verdad
+---+---+---+--------+
| p | q | r | result |
+===+===+===+========+
| 0 | 0 | 0 | 1 |
+---+---+---+--------+
| 0 | 0 | 1 | 0 |
+---+---+---+--------+
| 0 | 1 | 0 | 1 |
+---+---+---+--------+
| 0 | 1 | 1 | 1 |
+---+---+---+--------+
| 1 | 0 | 0 | 1 |
+---+---+---+--------+
| 1 | 0 | 1 | 0 |
+---+---+---+--------+
| 1 | 1 | 0 | 0 |
+---+---+---+--------+
| 1 | 1 | 1 | 0 |
+---+---+---+--------+
$$\left(q \vee \neg q\right) \wedge \left(q \vee \neg r\right) \wedge \left(\neg p \vee \neg q\right) \wedge \left(\neg p \vee \neg r\right)$$
(q∨(¬q))∧(q∨(¬r))∧((¬p)∨(¬q))∧((¬p)∨(¬r))
$$\left(q \wedge \neg p\right) \vee \left(\neg q \wedge \neg r\right)$$
Ya está reducido a FND
$$\left(q \wedge \neg p\right) \vee \left(\neg q \wedge \neg r\right)$$
$$\left(q \vee \neg r\right) \wedge \left(\neg p \vee \neg q\right)$$