Expresión A∨(¬A⇔B)∧C
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$b ⇔ \neg a = \left(a \wedge \neg b\right) \vee \left(b \wedge \neg a\right)$$
$$c \wedge \left(b ⇔ \neg a\right) = c \wedge \left(a \vee b\right) \wedge \left(\neg a \vee \neg b\right)$$
$$a \vee \left(c \wedge \left(b ⇔ \neg a\right)\right) = a \vee \left(b \wedge c\right)$$
$$a \vee \left(b \wedge c\right)$$
Tabla de verdad
+---+---+---+--------+
| a | b | c | result |
+===+===+===+========+
| 0 | 0 | 0 | 0 |
+---+---+---+--------+
| 0 | 0 | 1 | 0 |
+---+---+---+--------+
| 0 | 1 | 0 | 0 |
+---+---+---+--------+
| 0 | 1 | 1 | 1 |
+---+---+---+--------+
| 1 | 0 | 0 | 1 |
+---+---+---+--------+
| 1 | 0 | 1 | 1 |
+---+---+---+--------+
| 1 | 1 | 0 | 1 |
+---+---+---+--------+
| 1 | 1 | 1 | 1 |
+---+---+---+--------+
$$\left(a \vee b\right) \wedge \left(a \vee c\right)$$
Ya está reducido a FND
$$a \vee \left(b \wedge c\right)$$
$$\left(a \vee b\right) \wedge \left(a \vee c\right)$$
$$a \vee \left(b \wedge c\right)$$