 The key observation for obtaining C is simple: in the presence of the double negation introduction law, it suffices to validate both BT′ and its converse ~(A → B) → (A → ~B). In other words, an interpretation of the falsification conditions of implications is called for, which deviates from the standard conditions. In Nelson’s systems of constructive logic, the double negation laws hold, and the relational semantics for these logics is such that falsification and verification of formulas are dealt with separately. The system N4 extends FDE by intuitionistic implication, however, the falsification conditions of implications are the classical ones expressed by the schema ~(A → B) ↔ (A ∧ ~B). To obtain a connexive implication, it is therefore enough to assume another interpretation of the falsification conditions of implications, namely the one expressed by BTe′: (A → ~B) ↔ ~(A → B).