does godel's incompleteness theorem shed any light on dynamic vs typed languages?
Haskell is Turing-complete.  That means, any computation that can be expressed in Clojure, can also be expressed in Haskell (and vice versa).  Consequently, there is no difference in the expressibility of the two languages.  This remains true despite the type system.

I'm not aware of any insight that Godel's incompleteness theorem offers into whether statically typed languages are "better" than untyped languages (for some unspecified definition of "better").