Given an undecidable collection of first-order sentences, is there necessarily a complete undecidable theory containing it? A A direct attempt to prove it seems to require some control over the completions which need not exist, but I don't see a counterexample.
On a more concrete side, Macyntire proved that the theory of all pairs of real closed fields is undecidable. I am interested to know if there is a particular pair of real closed fields with undecidable theory.