Math: symbolic logic meets digital circuits: p→q means ¬A or B
The tutor translates p→q to the boolean expression ¬A or B.
In my beginning post about symbolic logic, I mention that the statement p implies q, also stated p→q, has the following truth table:
| p | q | p→q |
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
(I also mention, in that same post, the symbols and so on needed to understand basic logical expressions such as the ones herein.)
In digital logic (aka, digital circuits, boolean expressions, etc), ¬A or B has the same truth table:
| A | B | ¬A or B |
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
Neat, eh?
Source:
Grimaldi, Ralph P. Discrete and Combinatorial Mathematics, 3rd ed. Don Mills: Addison-Wesley Publishing Company, 1994.
Jack of Oracle Tutoring by Jack and Diane, Campbell River, BC.
Leave a Reply
You must be logged in to post a comment.