If a language is Turing decidable, does that make the sublanguages also Turing decidable
Is the following statement true ? If $L$ is a decidable language and $L' \subseteq \; L$, then $L'$ is also decidable ? Prove your answer is correct