Boolean logic - Truth tables |
To determine the truth value of a compound statement, we must examine the truth values assigns to its components. The table below identifies the truth values of various compound statements. The symbols p and q represent given statements.
| p | q | p OR q | p AND q | NOT p | NOT q |
| T | T | T | T | F | F |
| T | F | T | F | F | T |
| F | T | T | F | T | F |
| F | F | F | F | T | T |
Example |
Truth tables can help us calculate the truth values of such complex statements, as the following example shows.
| p | q | NOT p | NOT q | (NOT p) OR (NOT q) |
| T | T | F | F | F |
| T | F | F | T | T |
| F | T | T | F | T |
| F | F | T | T | T |
[Rev 25/03/99]24/6/97 © 1997-99 V/2-Com (Verhaart), P O Box 8415, Havelock North, New Zealand.
