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
Logical equivalence
Now, we can use our truth table to determine the outcome of compound propositions. Since ¬a ∨ b and a → b have the same truth values, they are said to be logically equivalent and we express that with the ¬a ∨ b ≡ a → b equation.
|
a |
b |
¬a |
¬a ∨ b |
a → b |
|
T |
T |
F |
T |
T |
|
T |
F |
F |
F |
F |
|
F |
T |
T |
T |
T |
|
F |
F |
T |
T |
T |
A logically equivalent statement could be, "If Jenny were sitting at her desk then she'd be at home." That is a logical statement. A logical equivalent statement might be, "If Jenny were not at home, then she would not be sitting at her desk."
We create logical equivalences by creating a hypothesis and its conclusion. The preceding hypothesis is: "If Jenny were sitting at ...