Sr Examen
Lógica matemática/ AandnotCorCand(BornotC)or(AornotB)andC

Expresión AandnotCorCand(BornotC)or(AornotB)andC

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

⌨

    Solución

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