We introduce a general notion of semi-implication which generalizes both the implications used in classical, intuitionistic, and many other logics, as well as those used in relevance logics. It is mainly based on the relevant deduction property (RDP)—a weak form of the classical-intuitionistic deduction theorem which has motivated the design of the intensional fragments of the relevance logic R. However, CL ↔, the pure equivalential fragment of classical logic, also enjoys the RDP with respect to ↔. We show that in the language of → this is the only exception. This observation leads to an adequate definition of semi-implication, according to which a finitary logic L has a semi-implication → iff L has a strongly sound and complete Hilbert-type system which is an extension by axiom schemas of HR → (the standard Hilbert-type system for the implicational fragment of R). We also show that in the presence of a conjunction, or a disjunction, or an implication, a connective → of a logic L is a semi-implication iff it is an implication (i.e. it satisfies the classical-intuitionistic deduction theorem), and the same is true if L is induced by a matrix which has a single designated value or a single non-designated value.