Question
Question: Equivalence proposition of \(p \Leftrightarrow q\) is...
Equivalence proposition of p⇔q is
Solution
If there are two statements such as p and q then the compound statement (p⇒q)∧(q⇒p) means that p implies q and q implies p, this is called a Bi-conditional statement or Equivalence. It is denoted by p⇔q or p≡q. For two propositions to be Logically Equivalent they should have the identical truth tables.
Symbols used and their meanings:
p⇒q means p implies q and it is a Conditional connective.
p∧q means p and q and it is a Conjunction connective.
p∨q means p or q and it is a Disjunction connective.
p⇔q means p if and only if q and it is a Biconditional connective.
Complete step by step solution
Given:
p and q are two statements then using the Logical Equivalences Involving Bi-conditional Statements p⇔q can be written as:
(p⇒q)∧(q⇒p)
Now we have to prepare a truth table for p⇔q on the basis of truth tables for ⇒ and ∧ which includes all the variables.
p | q | p⇔q | (p∨q)∨(p∧q) | (p⇒q)∧(p⇒q) | (p∧q)∨(p⇒q) | (p∧q)⇒(p∨q) |
---|---|---|---|---|---|---|
T | T | T | T | T | T | T |
T | F | F | T | F | F | T |
F | T | F | T | T | T | T |
F | F | T | F | T | T | T |
From the truth table it is clear that the propositions are logically equivalent. So, the logically equivalent proposition of p⇔q is (p∧q)⇒(p∨q).
Note: It may be noted that from the table that p⇔q is true only when either both p and q are true or both are false. Also, from the truth tables it is confirmed that the given propositions are logically equivalent because they have the identical truth tables.