How can I write:
$A \to B ∧ B \to A $
as a statement with only '$\to$' and '$\neg$' ?
Asked
Active
Viewed 137 times
0
2 Answers
2
$$\begin{array}{cl} & [A \implies B] \land [B \implies A] \\ =& [A \implies B] \land \neg \neg[B \implies A] \\ =& \neg([A \implies B] \implies \neg[B \implies A]) \\ \end{array}$$
Alternatively:
$$\begin{array}{cl} & [A \implies B] \land [B \implies A] \\ =& [A \land B] \lor [\neg A \land \neg B] \\ =& \neg[\neg A \lor \neg B] \lor [\neg A \land \neg B] \\ =& [\neg A \lor \neg B] \implies [\neg A \land \neg B] \\ =& [A \implies \neg B] \implies \neg [\neg A \implies B] \\ \end{array}$$
Kenny Lau
- 25,049
1
We have:
$\lnot (P \to Q) \equiv (P \land \lnot Q)$
and thus:
$\lnot (P \to \lnot Q) \equiv (P \land Q)$.
Thus, we have to rewite the "and" in $(A \to B) \land (B \to A)$ to get:
$\lnot ((A \to B) \to \lnot (B \to A))$
Mauro ALLEGRANZA
- 94,169
\land– Kenny Lau Sep 10 '17 at 16:14