Sr Examen

Expresión notcand(a⇔b)

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

    Solución

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