5 votes 5 votes In propositional language $P \leftrightarrow Q$ is equivalent to (where $\sim$ denotes NOT) $\sim (P \vee Q) \wedge \sim (Q \vee P)$ $(\sim P \vee Q) \wedge (\sim Q \vee P)$ $(P \vee Q) \wedge (Q \vee P)$ $\sim (P \vee Q) \rightarrow \sim (Q \vee P)$ Discrete Mathematics ugcnetcse-june2015-paper3 discrete-mathematics propositional-logic + – go_editor asked Aug 1, 2016 • recategorized Nov 24, 2017 by Arjun go_editor 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes P ↔ Q (P → Q) ∧ (Q → P) (~ P ∨ Q) ∧ (~ Q ∨ P) B is ans Prashant. answered Aug 1, 2016 • selected Aug 1, 2016 by Prashant. Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes bi conditional means conditional from both side hence p<-->q => p->q and q->p which is nothing but ~pvq and ~q V p hence ans is B Meenakshi Sharma answered Aug 1, 2016 Meenakshi Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.