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