For understanding the results of Logical Connectives in Mathematical Statements.
The convention is arranged like binary. F=0, T=1.
Starts with highest binary number, ends with lowest binary number.
Example:
| A | B | C |
|---|---|---|
| T | T | T |
| T | T | F |
| T | F | T |
| F | T | T |
| F | F | T |
| F | F | F |