Umm, ok. You were the one who gave the halting theorem as an example.
I don't think this is true. The theorem states:
For any consistent formal, computably enumerabletheory that proves basic arithmetical truths, an arithmetical statement that is true, but not provable in the theory, can be...