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