In propositional language 𝑃 ↔ 𝑄 is equivalent to (where ∼ denotes NOT) :

2015

In propositional language 𝑃 ↔ 𝑄 is equivalent to (where ∼ denotes NOT) :

  1. A.

    ∼(π‘ƒβˆ¨π‘„)∧∼(π‘„βˆ¨π‘ƒ)

  2. B.

    (βˆΌπ‘ƒβˆ¨π‘„)∧(βˆΌπ‘„βˆ¨π‘ƒ)

  3. C.

    (π‘ƒβˆ¨π‘„)∧(π‘„βˆ¨π‘ƒ)

  4. D.

    ∼(π‘ƒβˆ¨π‘„)β†’βˆΌ(π‘„βˆ¨π‘ƒ)

Attempted by 181 students.

Show answer & explanation

Correct answer: B

Derivation: Start from the biconditional and rewrite implications.

P↔Q ≑ (Pβ†’Q) ∧ (Qβ†’P).

Replace each implication using Pβ†’Q ≑ Β¬P ∨ Q and Qβ†’P ≑ Β¬Q ∨ P to get:

(¬P ∨ Q) ∧ (¬Q ∨ P)

Therefore the biconditional is equivalent to (¬P ∨ Q) ∧ (¬Q ∨ P).

Why the other expressions are not equivalent:

  • The expression Β¬(P∨Q) ∧ Β¬(Q∨P) simplifies to Β¬P ∧ Β¬Q, which is true only when both P and Q are false.

  • The expression (P∨Q) ∧ (Q∨P) simplifies to P∨Q, which is true when at least one of P or Q is true; it does not require P and Q to have the same truth value.

  • The implication Β¬(P∨Q) β†’ Β¬(Q∨P) has identical antecedent and consequent, so it is always true (a tautology); the biconditional is not a tautology.

Explore the full course: Mppsc Assistant Professor