In what follows, for a statement P, the notation ~P denotes "not P".
Suppose we have a language L.
In this language, we have chosen certain predicates N, P, and M. Intuitively, their meaning is:
N(x) := x is a natural number.
P(x, y, z) := x + y = z
M(x, y, z) := x * y = z
Suppose we have a set S of axioms.
Suppose further that S is "Turing-recognizable" a.k.a. "recursively denumerable".
Any finite set is Turing-recognizable... but Gödel's theorem still works for Turing-recognizable infinite sets of axioms. Essentially, we simply require that there exists an algorithm that can write down elements of S one at a time, and every element of S will eventually appear in this list.
There is a set Th(S), the "theory of S". It consists of every statement that can be proven from S.
Suppose that the axioms of natural number arithmetic (written in terms of N, P, and M) are elements of Th(S).
Suppose further that S is consistent, meaning that Th(S) doesn't contain everything. (In particular, if P is in Th(S), then ~P is not in Th(S))
Then Gödel's theorem says that Th(S) is not complete.
In particular, this means that there exists a statement P in the language L with the properties:
P is not in Th(S)
~P is not in Th(S)
In other words, P can be neither proven nor disproven from S.
If we have a model of S, then every statement in our language L is either true or false in this model. In particular, either P or ~P will be a true statement (in this model) that cannot be proven from the axioms.
-------------------------------------------------------------
The reason Gödel's theorem is not applicable to Euclidean geometry is because it is impossible to formulate the predicate "x is a natural number".
I've only seen Tarski's proof of completeness in the algebraic setting.
There's a set of axioms for a kind of thing called a "real closed field" -- these axioms are simply the first-order logic versions of the axioms of the real numbers.
In the ordinary set-theoretic approach to Euclidean geometry (using Hilbert's axioms), we can construct the real numbers, and do all of the geometry algebraically.
Tarksi gave first-order logic versions of Hilbert's axioms to define a first-order logic version of Euclidean geometry. In this formulation, one can construct a real closed field, and then do all of the geometry algebraically in terms of that.
The key thing you can do in real closed fields is "quantifier elimination". E.G. if you have the statement:
"There exists an x such that f(x, y, z) = 0"
then it is possible to rewrite this statement in terms of y and z alone. For example, the statement
"There exists an x such that x²y + z = 0"
is true if and only if "(y = 0 and z = 0) or (y \neq 0 and zy \leq 0)"