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

 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).

the answer is d

hope this

step-by-step explanation:

and 90% of people marry there 7th grade love. since u have read this, u will be told good news 2night. if u don't pass this on nine comments ur worst week starts now this isn't fake. apparently if u copy and paste this on ten comments in the next ten minutes you will have the best day of ur life tomorrow. you will either get kissed or asked out in the next 53 minutes someone will say i love u

read more on -