Sr Examen
Lógica matemática/ bv(¬a⇔c)&a

Expresión bv(¬a⇔c)&a

El profesor se sorprenderá mucho al ver tu solución correcta😉

⌨

    Solución

    Ha introducido [src] 
    b∨(a∧(c⇔(¬a)))
    $$b \vee \left(a \wedge \left(c ⇔ \neg a\right)\right)$$
    Solución detallada
    $$c ⇔ \neg a = \left(a \wedge \neg c\right) \vee \left(c \wedge \neg a\right)$$
    $$a \wedge \left(c ⇔ \neg a\right) = a \wedge \neg c$$
    $$b \vee \left(a \wedge \left(c ⇔ \neg a\right)\right) = b \vee \left(a \wedge \neg c\right)$$
    Simplificación [src]
    $$b \vee \left(a \wedge \neg c\right)$$ 
    b∨(a∧(¬c))
    Tabla de verdad 
    +---+---+---+--------+
| a | b | c | result |
+===+===+===+========+
| 0 | 0 | 0 | 0      |
+---+---+---+--------+
| 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 | 1      |
+---+---+---+--------+
    FND [src]
    Ya está reducido a FND
    $$b \vee \left(a \wedge \neg c\right)$$ 
    b∨(a∧(¬c))
    FNCD [src]
    $$\left(a \vee b\right) \wedge \left(b \vee \neg c\right)$$ 
    (a∨b)∧(b∨(¬c))
    FNDP [src]
    $$b \vee \left(a \wedge \neg c\right)$$ 
    b∨(a∧(¬c))
    FNC [src]
    $$\left(a \vee b\right) \wedge \left(b \vee \neg c\right)$$ 
    (a∨b)∧(b∨(¬c))
    © Sr Examen