 The fact that the biconditional connective is special in R may appear to conflict with the fact, established in Blok and Pigozzi (1989) that this logic is what the authors call algebraizable. This term is applied to consequence relations ⊢ which are translationally equivalent to the quasi-equational consequence relation ⊨K of a class of algebras of the same similarity type as the language of ⊢. That is, for equations e1,…,en, we have e1,…,en−1⊨K en just in case for any algebra A ∈ K and any assignment of elements of A to the variables in the ei, if all of e1,…,en−1 come out true in A on that assignment, so does en. The translational equivalence idea means that there is a translation τ from formulas of the (sentential) language of ⊢ to equations of the language of K, and a translation τ′ back in the other direction, which are mutually inverse in the sense that φ ⊣⊢ τ′(τ(φ)) and e ⫤⊨K τ(τ′(e)) for all formulas φ and equations e, and, for all formulas φ1,…,φn and equations e1,…,en, either of the following conditions is satisfied (from which it follows that both are):