Logical equivalence
Definition
Let and be formulas of propositional logic. The formulas and are logically equivalent when they have the same truth value for each assignment of truth values to their variables. This is written .
Remarks
The formulas and are logically equivalent exactly when is a tautology. For example, . De Morgan's laws give two more examples.
Explanations
L1 human
Logically equivalent formulas say the same thing in different words. You can check an equivalence with a truth table: the two columns must agree in every row. Then you can replace one formula by the other in a proof.
What this node needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 10 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Proposition concept
- Conjunction definition
- Disjunction definition
- Implication definition
- Negation definition
- Biconditional definition
- Truth table concept
- Propositional logic concept
- Tautology definition
- Logical equivalence definition
What depends on this
12 nodes use this node, directly or through other nodes.
- Cantor set is closed 01VT24J1SD
- Closure is closed 02TZDKG50Q
- Contrapositive 04T1CT7212
- De Morgan's laws 09PKJKA6J0
- Intersection of closed sets is closed 09YMV8H4X5
- Proof by contrapositive 0BB5TPGQ1N
- A set is closed iff it equals its closure 0D2W7FS52T
- Russell's paradox 0HESMMSYEG
- Proof by contradiction 0J0XBKG64S
- Double negation law 0NFAGWH84K
- Closure is the smallest closed superset 0SHC6Z304Z
- De Morgan's laws for sets 0VK0W4D5Y5
Sources
- Web https://en.wikipedia.org/wiki/Logical_equivalence, lead section
What links here
Used by
- Contrapositive 04T1CT7212
- De Morgan's laws 09PKJKA6J0
- Double negation law 0NFAGWH84K