Ask Question
4 May, 15:27

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

+1
Answers (1)
  1. 4 May, 19:06
    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?
Find 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 you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers