Which of the following well-formed formulas are equivalent?
Note that, relating to conditional and biconditional statements, and their converse, inverse, or contrapositive: only a conditional and its contrapositive are equivalent (p → q ≡ ¬q → ¬p), and only a biconditional and its inverse are equivalent (p ↔ q ≡ ¬p ↔ ¬q).
So, $A,B,C$ are equivalent .
So, $A,B$ and $C$ are equivalent.
I know that sir Or wil changes to And. thats why changed that.
Let P and Q be statements.
1. (P→Q)⇔(¬P V Q),
2. (P→Q)⇔(¬Q→¬P), that is, the implication P→Q is logically equivalent to the contrapositive ¬Q→¬P.
Hence 1 2 and 3 are equivalent.
64.3k questions
77.9k answers
244k comments
80.0k users