What is the Equivalence of Biconditional Connectives?

  • Thread starter Herricane
  • Start date
In summary, to show that P <-> Q is equivalent to (P ^ Q) V (¬P ^ ¬Q), we can use the laws (P -> Q) ^ (Q -> P) and P -> Q is equivalent to ¬p V Q. By distributing the whole left conjunct, we can simplify the expression to ((¬P ^ ¬Q) V (Q ^ ¬Q)) V ((¬P ^ P) V (Q ^ P)). This can be further simplified to (¬P ^ ¬Q) V (Q ^ P), which is equivalent to (P ^ Q) V (¬P ^ ¬Q). Therefore, P <-> Q is equivalent to (P ^ Q) V (¬P ^ ¬
  • #1
Herricane
61
1

Homework Statement



Show that P <-> Q is equivalent to (P ^ Q) V (¬P ^ ¬Q)

Homework Equations



P <-> Q is equivalent to (P -> Q) ^ (Q -> P)
P -> Q is equivalent to ¬p V Q
P -> Q is equivalent to ¬(P ^ ¬Q)
p -> Q is equivalent to ¬Q -> ¬P

The Attempt at a Solution



P <-> Q
(P -> Q) ^ (Q -> P)
(¬P V Q) ^ (¬Q V P)

I stuck I can't use the distributive law because I don't have one that is common to both parts.

P <-> Q
(P -> Q) ^ (Q ->P)
(¬Q -> ¬P)^(Q -> P) contrapositve law
(Q v ¬P) ^ (¬Q V P)
again I can't use the distributive law

Can anyone give my any hints?

Thanks
 
Physics news on Phys.org
  • #2
Why not just make a truth table? It only has 4 rows.
 
  • #3
I was thinking of doing that, but I just thought there was a way to do it with the laws.
 
  • #4
If the problem is to use the laws, don't you have to use the laws?

Why can't you use distribution? Distribute the whole left (or right) conjunct.

(¬P V Q) ^ (¬Q V P)
((¬P V Q) ^ ¬Q) V ((¬P V Q) ^ P)

And use it again.

((¬P ^ ¬Q) V (Q ^ ¬Q)) V ((¬P ^ P) V (Q ^ P))

What's wrong with (Q ^ ¬Q)?
 

FAQ: What is the Equivalence of Biconditional Connectives?

What are biconditional connectives?

Biconditional connectives are logical operators that connect two statements and indicate that both statements are true if and only if they have the same truth value.

How are biconditional connectives represented in logical notation?

Biconditional connectives are represented by the symbol "↔" or "⇔" in logical notation.

What is the truth table for biconditional connectives?

The truth table for biconditional connectives is as follows:
p | q | p ↔ q
T | T | T
T | F | F
F | T | F
F | F | T

How are biconditional connectives used in mathematical proofs?

In mathematical proofs, biconditional connectives are used to state necessary and sufficient conditions for a statement to be true. They are also used to show the equivalence of two statements.

Are there any other names for biconditional connectives?

Yes, biconditional connectives are sometimes referred to as "if and only if" connectives or "double implication" connectives.

Back
Top