 Indeed, in Carnielli and Coniglio 2005 it is shown that non-deterministic matrices can be simulated by appropriate possible-translations semantics. In particular, the familiar matrix semantics are a particular case of possible-translations semantics, as well as the historical examples of translations between logics found in the literature. These facts evidence that possible-translations semantics is a widely applicable conceptual tool for decomposing logics.