 The set of validities of basic modal logic is not only recursively enumerable (as the enumerability theorem proves) but the satisfiability problem is also decidable. We wonder, what is the gain in translating a decidable logic into an undecidable one? Are we loosing decidability? The answer is that we don’t loose decidability; in fact, one can use translations to prove decidability for basic modal logic.