Godel's theorems are notoriously liable to misinterpretation, and to be honest this sounds like one.
What Godel actually proved is that given a consistent formal system capable of representing arithmetic, there are statements in the language of that system such that neither the statement nor its negation can be proved in the system.
The thing is these statements will be different for different formal systems. The theorem doesn't say that there are statements that are in general unprovable in any formal system, which is a common misconception. Maybe that's not what you're saying, but I find it hard to relate the claims your making about Godel's theorem to the statement of the theorem itself.
Godel's proof itself can be formalized, so I don't see how it places a limitation on formalism in general