Studiot said:
Please explain further.
This philosophy of maths / very pure maths is beyond my normal field, but interesting.
OK, a first order theory is a theory that only allows quantification over individuals, not quantification over sets. So in the first order theory of real numbers, you can say "for all real numbers x, ...", but you can't say "for all sets F of real numbers, ..." (for that you'd need the second-order theory).
Now the standard first-order theory of natural numbers is called Peano Arithmetic (PA), and Godel's theorem applies to any theory which can prove all the facts about natural numbers that PA can prove. But it turns out that in the theory of real closed fields (RCF), which is the standard first-order theory of real numbers, we can't even talk about natural numbers! The axioms of RCF are all the axioms for fields, plus one additional axiom which is stated
http://en.wikipedia.org/wiki/Real_closed_field#Definitions". You may be thinking, if the field axioms define both the multiplicative identity (1) and addition, that would be enough to talk about natural numbers; you could just say that natural numbers are 1, 1+1, 1+1+1, and so on. The problem is, what does "and so on" mean? It's not precise enough for a formal theory.
Here's a proper definition of natural numbers. A set F of real numbers is called hereditary if it is closed under the successor operation; in other words, x+1 \in F whenever x \in F. Then we can say that a natural number is a real number which belongs to all hereditary sets containing 1. If you stare at that long enough, you'll find that it works: 1 is a natural number because it belongs to all sets containing 1, so in particular it belongs to all hereditary sets containing 1. 2 is a natural number because it is 1+1, so any hereditary set that contains 1 automatically contains 2. Etc. Since this definition used the phrase "ALL hereditary sets", any statement about natural numbers is necessarily second-order in the theory of real numbers.
Because of all this, Godel's theorem doesn't apply to RCL, so Tarski was able to show that RCL is complete, consistent, and even decidable (meaning you can write an algorithm which decides whether any given first-order statement about real numbers is true or false, something you can never dream of doing with the natural numbers).