The sentential calculus E-Mingle (EM) is obtained by adding the axiom scheme A->(A-*A) to the Belnap-Anderson system E of Eelevant Implication. We shall here presume that EM has been explicitly axioma tized as in [2], and shall cite various theorems of EM listed there by name, e.g., Transitivity. EM has a model theory in terms of Sugihara matrices, as was discovered by Meyer [9]1. Here, however, is presented a model theory using Kripke's device of model structures with a binary accessibility relation. The prin? cipal point of departure from Kripke is the consideration of models which allow sentences to be simultaneously both "true" and "false". When the basic results here were first obtained back in 19692 there was no need to explicitly mention that the semantics presented used a binary accessibility relation. That was surely a part of the ordinary meaning of the phrase "Kripke-style semantics". But since then the work of Eoutley and Meyer (cf. [13]) and others has shown how to extend Kripke-style semantics to allow for ternary accessibility relations. This has been particularly fruitful in the case of the relevance logics, and [13] its successors contains completeness results for various of these logics, including E and EM (cf. also [4]). It must be frankly confessed that the ingenuity and the power of the ternary semantics were so overwhelming to this author they caused delay until now of full publication of the binary semantics for EM. There had been at first the vain hope that the binary semantics could be extended to the other relevance logics, and then with the success of the ternary approach the binary semantics became to appear old-fashioned and special.