Can a solvable problem be encoded in a recursively enumerable language?
Almost immediately from definitions, one has:


A solvable (decidable) problem can be encoded as (not in) a recursive language. 
A semi-decidable problem can be encoded as (not in) a recursively enumerable language.