Let $\mathcal{L}$ be some first-order language, and $T$ be a consistent set of formulas of $\mathcal{L}$ which is not recursively enumerable.

Under what conditions will there be $T'\supset T$ such that $T'$ is consistent and recursively enumerable?