 The Boolean connexive logics of Jarmużek and Malinowski 2019a are obtained in the framework of  relating logic, a generalization of relatedness logic. The latter is an instance of what Sylvan (1989, p. 166) calls a “double-barrelled” analysis of implications, an analysis that complements truth conditions with an additional “sieve” or “filter” that tightens the relation between antecedent and succedent. If the relation is meant to be a relevance relation, this is an example of what Schurz 1998 calls “relevance post validity” in contrast to “relevance in validity” as investigated in relevance logic. Boolean connexive logics extend the language of classical propositional logic using conjunction, disjunction, and Boolean negation by a relating implication, →w, the semantics of which is constrained by a binary relation R on the set of all formulas. A model then is a pair &lt;v,R&gt;, where v is a classical valuation function. The truth condition for relating implication imposes the relatedness constraint: