|
T | T | T | T | T | T T | F | F | T | F | F F | T | F | T | F | T F | F | F | F | T | T |
|
T | T | T | T | F | T T | F | F | T | T | F F | T | F | T | T | T F | F | F | F | F | T |
|
A truth table is the explicit depiction of the relationship of logical operators such as not?, and?, or?, conditional, and biconditional?. Generally limited to [bivalent logic system]?s (where only two [truth value]?s are possible, true? or false?), the possible values of the terms involved are enumerated, as well as the result of performing the logical operation on the terms. |
|
A truth table is the explicit depiction of the relationship of logical operators such as not?, and, or?, conditional?, and biconditional?. Generally limited to [bivalent logic system]?s (where only two [truth value]?s are possible, true? or false?), the possible values of the terms involved are enumerated, as well as the result of performing the logical operation on the terms. |
|
Because the enumeration of possible truth values for A and B yeilds the same truth value under both ¬ ( A ∧ B ) and ¬ A ∨ ¬ B, the two are logically equivalent, and may be substituted for each other (this particular equivalence is one of [DeMorgan's Law]?s). |
|
Because the enumeration of possible truth values for A and B yeilds the same truth value under both ¬ ( A ∧ B ) and ¬ A ∨ ¬ B, the two are logically equivalent, and may be substituted for each other (this particular equivalence is one of [DeMorgan's Law]?s). |
![[Home]](wikipedia.png)