ABSTRACT
In statement logic a conjunction is true in just one case: when both conjuncts are true. At all other times it is false. These truth-values are all we need to know in order to know a conjunction's truth-value. We can therefore define the truth-function P and Q by a matrix called a truth-table. I introduced the basic table for 'or' that is for the form P or Q which all 'or'-statements share - in the answers to Chapter 19. Here is the basic table for 'and'.
|
P |
Q |
P and Q |
|
|---|---|---|---|
|
(1) |
T |
T |
T |
|
(2) |
T |
F |
F |
|
(3) |
F |
T |
F |
|
(4) |
F |
F |
F |
