problems with recursive languages decidable

Since yes-no problems can be posed as languages, problems with a recursive languages are decidable . This is because for recursive languages there exist TMs which will say yes or no for all inputs.