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
Augustus De Morgan (1806 - 1871)
De Morgan's Law stated that all logical operations can be expressed in terms of and, or, and not. Furthermore, all logical operations can also be expressed in terms of just and and not, or just or and not:
a ∧ b = ¬ ( (¬ a) ∨ (¬ b) ) a ∨ b = ¬ ( (¬ a) ∧ (¬ b) )
The first equation says that a and b are both true if and only if at least one of a or b is false. The second equation says that at least one of a or b is true if and only if both a and b are false.