Sr Examen

Expresión (A∧B)∨(C∧D)⇒C

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

    Solución

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