 A theory \(F\) is called essentially undecidable if every consistent extension of it in the language of \(F\) is undecidable. The above proof sketch in fact establishes that Q is essentially undecidable. (There are some very weak theories that are undecidable but not essentially undecidable.)