Expresión ¬(p⇔q)⇒p∧¬r
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$p ⇔ q = \left(p \wedge q\right) \vee \left(\neg p \wedge \neg q\right)$$
$$p \not\equiv q = \left(p \wedge \neg q\right) \vee \left(q \wedge \neg p\right)$$
$$p \not\equiv q \Rightarrow \left(p \wedge \neg r\right) = \left(p \wedge q\right) \vee \left(\neg p \wedge \neg q\right) \vee \left(\neg q \wedge \neg r\right)$$
$$\left(p \wedge q\right) \vee \left(\neg p \wedge \neg q\right) \vee \left(\neg q \wedge \neg r\right)$$
(p∧q)∨((¬p)∧(¬q))∨((¬q)∧(¬r))
Tabla de verdad
+---+---+---+--------+
| p | q | r | result |
+===+===+===+========+
| 0 | 0 | 0 | 1 |
+---+---+---+--------+
| 0 | 0 | 1 | 1 |
+---+---+---+--------+
| 0 | 1 | 0 | 0 |
+---+---+---+--------+
| 0 | 1 | 1 | 0 |
+---+---+---+--------+
| 1 | 0 | 0 | 1 |
+---+---+---+--------+
| 1 | 0 | 1 | 0 |
+---+---+---+--------+
| 1 | 1 | 0 | 1 |
+---+---+---+--------+
| 1 | 1 | 1 | 1 |
+---+---+---+--------+
$$\left(p \wedge q\right) \vee \left(\neg p \wedge \neg q\right) \vee \left(\neg q \wedge \neg r\right)$$
(p∧q)∨((¬p)∧(¬q))∨((¬q)∧(¬r))
$$\left(p \vee \neg q\right) \wedge \left(q \vee \neg q\right) \wedge \left(p \vee \neg p \vee \neg q\right) \wedge \left(p \vee \neg p \vee \neg r\right) \wedge \left(p \vee \neg q \vee \neg r\right) \wedge \left(q \vee \neg p \vee \neg q\right) \wedge \left(q \vee \neg p \vee \neg r\right) \wedge \left(q \vee \neg q \vee \neg r\right)$$
(p∨(¬q))∧(q∨(¬q))∧(p∨(¬p)∨(¬q))∧(p∨(¬p)∨(¬r))∧(p∨(¬q)∨(¬r))∧(q∨(¬p)∨(¬q))∧(q∨(¬p)∨(¬r))∧(q∨(¬q)∨(¬r))
$$\left(p \vee \neg q\right) \wedge \left(q \vee \neg p \vee \neg r\right)$$
Ya está reducido a FND
$$\left(p \wedge q\right) \vee \left(\neg p \wedge \neg q\right) \vee \left(\neg q \wedge \neg r\right)$$
(p∧q)∨((¬p)∧(¬q))∨((¬q)∧(¬r))