Ask Question
14 July, 02:26

Use truth tables to show that the following statements are logically equivalent. ∼ P ⇔ Q = (P ⇒∼ Q) ∧ (∼ Q ⇒ P)

+5
Answers (1)
  1. 14 July, 06:22
    0
    Answer: The given logical equivalence is proved below.

    Step-by-step explanation: We are given to use truth tables to show the following logical equivalence:

    ∼ P ⇔ Q ≡ (P ⇒∼ Q) ∧ (∼ Q ⇒ P)

    We know that

    two compound propositions are said to be logically equivalent if they have same corresponding truth values in the truth table.

    The truth table is as follows:

    P Q ∼ P ∼Q ∼ P⇔ Q P ⇒∼ Q ∼ Q ⇒ P (P ⇒∼ Q) ∧ (∼ Q ⇒ P)

    T T F F F F T F

    T F F T T T T T

    F T T F T T T T

    F F T T F T F F

    Since the corresponding truth vales for ∼ P ⇔ Q and (P ⇒∼ Q) ∧ (∼ Q ⇒ P) are same, so the given propositions are logically equivalent.

    Thus, ∼ P ⇔ Q ≡ (P ⇒∼ Q) ∧ (∼ Q ⇒ P).
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Use truth tables to show that the following statements are logically equivalent. ∼ P ⇔ Q = (P ⇒∼ Q) ∧ (∼ Q ⇒ P) ...” in 📙 Mathematics if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers