Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Using only the operators ⇒ (conditional) and ∼ (negation)

Rewrite p ⇔ q

How should I go about this?

Thanks

share|improve this question

2 Answers 2

Note that $a\vee b$ can be written as $(\neg a)\Rightarrow b$ and that $a\wedge b$ can be written as $\neg((\neg a)\vee(\neg b))$ and thus as $\neg(a\Rightarrow (\neg b))$. $a\Leftrightarrow b$ can be written as $(a \Rightarrow b)\wedge(b\Rightarrow a)$ and hence also as $$\neg((a\Rightarrow b)\Rightarrow \neg(b\Rightarrow a)).$$

share|improve this answer
    
Ahhh yes. Thanks! –  k8lyn Sep 19 '13 at 21:22

$p\iff q \equiv (p\implies q) \land (q\implies p)$.

We can use $\implies$ but we somehow need to rewrite $\land$ in terms of $\implies$ and $\neg$. Note that $A\implies B \equiv \neg A\lor B$. So, $\neg (A\implies B)\equiv A\land \neg B$. To take care of $\neg B$, replace $B$ by its negation, so that $\neg(A\implies \neg B)\equiv A\land B$.

Substituting for $A$ and $B$, $(p\implies q)$ and $(q\implies p)$ respectively gives $$\neg((p\implies q)\implies \neg (q\implies p)).$$

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.