November 2017
Intermediate to advanced
670 pages
17h 35m
English
Content preview from Learning Functional Programming in Go
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Converse of a conditional proposition
Let's use a truth table to prove the (a → b)∧(b → a) ≡ a ↔ b equation:
|
a |
b |
a → b |
b → a |
(a → b)∧(b → a) |
a ↔ b |
|
T |
T |
T |
T |
T |
T |
|
T |
F |
F |
T |
F |
F |
|
F |
T |
T |
T |
F |
F |
|
F |
F |
T |
T |
T |
T |
In other words, a biconditional proposition (a ↔ b) is equivalent to the conjunction of a conditional proposition (a → b) and its converse (b → a).