518 views

2 Answers

Best answer
2 votes
2 votes

${\color{Green}{p\rightarrow q\equiv\sim p\vee q} }$  ----------$>(1)$

 $\sim q\rightarrow \sim p\equiv\sim(\sim q)\vee \sim p\equiv q\vee \sim p\equiv\sim p\vee q$     ----------$>(2)$

From equation $(1)$ and $(2)$ 

we can write    ${\color{Magenta}{p\rightarrow q\equiv\sim q\rightarrow \sim p} }$​​​

Actually, implication$(p\rightarrow q)$ and contrapositive$(\sim q\rightarrow \sim p)$ are equivalent.

We can show that the above relation using the truth table also.

selected by

Related questions

3 votes
3 votes
2 answers
2
Pooja Khatri asked Mar 16, 2019
1,190 views
Why are the duals of two equivalent compound propositions also equivalent, where these compound propositions contain only the operators $\wedge, \vee, \sim ?$
2 votes
2 votes
3 answers
3
0 votes
0 votes
2 answers
4