Let p and q be the statements of the compound statement. Then
(i) The compound statement p and q is the conjunction of p and q and is denoted by p ∧ q . (read: p and q)
Rule for compound statement with ‘And’ (conjunction)
This can be shown by the truth table
∴ Truth table for p ∧ q as follows
| p |
q |
p ∧ q |
| T |
T |
T |
| T |
F |
F |
| F |
T |
F |
| F |
F |
F |
(ii) The compound statement p or q is the disjunction of p and q, and is denoted by p v q (read: p ∨ q)
Rule: The disjunction p ∨ q is false if both p and q are false, otherwise it is true.
This can be shown by truth table
| p |
q |
p ∧ q |
| T |
T |
T |
| T |
F |
T |
| F |
T |
T |
| F |
F |
F
|
