Sr Examen

Expresión T→(((P→Q)→Q)∧(~P∧(~Q∨P)))

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

    Solución

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