Expresión [(~p→q)∧~(q→p)∨r]→q∧~p
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$\neg p \Rightarrow q = p \vee q$$
$$q \Rightarrow p = p \vee \neg q$$
$$q \not\Rightarrow p = q \wedge \neg p$$
$$\left(\neg p \Rightarrow q\right) \wedge q \not\Rightarrow p = q \wedge \neg p$$
$$r \vee \left(\left(\neg p \Rightarrow q\right) \wedge q \not\Rightarrow p\right) = r \vee \left(q \wedge \neg p\right)$$
$$\left(r \vee \left(\left(\neg p \Rightarrow q\right) \wedge q \not\Rightarrow p\right)\right) \Rightarrow \left(q \wedge \neg p\right) = \left(q \wedge \neg p\right) \vee \neg r$$
$$\left(q \wedge \neg p\right) \vee \neg r$$
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 | 1 |
+---+---+---+--------+
| 1 | 1 | 1 | 0 |
+---+---+---+--------+
$$\left(q \vee \neg r\right) \wedge \left(\neg p \vee \neg r\right)$$
$$\left(q \wedge \neg p\right) \vee \neg r$$
$$\left(q \vee \neg r\right) \wedge \left(\neg p \vee \neg r\right)$$
Ya está reducido a FND
$$\left(q \wedge \neg p\right) \vee \neg r$$