 For example, in classical logic a conjunction is bound to be false if one of its conjuncts is false, and therefore the same holds for Strong Kleene “and”. Similarly, since in classical logic a disjunction must be true if one of its disjuncts is true, the same holds for Strong Kleene “or”. We obtain the following truth tables for the main binary connectives: