>>5
Not at all.
Godel showed that any logical system that is "powerful" enough to include a model of the natural numbers is not both complete and consistent.
Now, if it were not consistent, that would be a worry. Given any system with the law of the excluded middle, if you can prove a statement is both true and false (Basically a system being inconsistent) you can prove that any statement is both true and false. That's bad for maths.
If it happens (and it does, as I'll explain later), that your model is not complete, that merely means there are statements in the language that cannot be proved within it.
Now anyone who studies maths can see this is actually rather plausible. I mean, a 10 year old can understand fermat's last theorem, the proof is horrendous. The fact that there might be statements that we cannot prove, never mind whether or not we appeal to a higher level system, is not unthinkable.
As it turns out, using second order logic you can prove, for example, peano's model of the natural numbers is consistent, which by godel's theorem implies it's incomplete. Which is much better than the other way round, or it being both.
Comprende?