Reflection schema It was claimed that there are capable philosophers of mathematics who are unfamiliar with basic logical notation. Maybe there are, but I don't know of any other than philosophers prior to the widespread use of notation in mathematical logic. To responsibly philosophize in modern context about subjects such as incompleteness does require understanding at least the basic technical material. We can outline certain notions with minimal notation, but at a certain point, if we wish not to oversimplify at the cost of being misinformational, we need to use some symbolisms. (For the most excellent discussion for the layman of incompleteness, refer to Franzen's 'Godel's Theorems', which is a beautifully written and truly insightful presentation.)
I am rusty in the subject of incompleteness, so my remarks might require corrections, but here is a sketch of some of the terminology and notions. To truly understand these notions, starting from the beginning, I recommend Kalish, Montague and Mar's 'Logic: Techniques Of Formal Reasoning' as an introduction to symbolic logic, then onto Enderton's 'Set Theory' for needed set theoretical context, then Enderton's 'A Mathematical Introduction To Logic' for mathematical logic including incompleteness):
(Throughout, where certain results are actually due to Godel-Rosser, for simplicity I'll refer merely to Godel. Also, Godel himself did not refer to 'the standard model', as the notion of a formal model was formalized a few years later by Tarski, but it's easier to discuss Godel with the notion, as the notion can reasonably be said to be implicit with Godel.)
PA is a theory in first order logic with identity, with the signature:
0 - constant, intuitively 'zero'
S - 1-place operation, intuitively 'successor'
+ - 2-place operation, intuitively 'addition'
* - 2-place operation, intutively 'multiplication'
The axioms of PA:
For all n and k, and for all formulas F:
0 not= Sn
i.e. 0 is not a successor
if Sn = Sk, then n = k
i.e. the successor function is 1-1
n+0 = n
n+Sk = S(n+k)
n*0 = 0
n*Sk = (n*k)+n
if (F(0) and for all n, F(n) then F(Sn)), then for all n, F(n)
i.e. (thinking of F as expressing a property) if F is true of 0 and whenever F is true of a natural number then it is true of that number's successor, then F is true of all natural numbers.
PA is a formal theory (i.e., a recursively axiomatized theory) in the sense that it is computable whether any given formula is or is not an axiom, and it is computable whether any given sequence of formulas is or is not a proof.
/
Let w = the set of natural numbers.
The standard interpretation of PA is the structure:
<w, zero, successor_on_w, addition_on_w, multiplication_on_w>
/
(Throughout, by 'symbol', 'sequences of symbols', 'sequence of sequences of symbols' I mean of PA.)
A formula is a certain kind of sequence of symbols. A sentence is a certain kind of formula. A proof is a certain kind of sequences of formulas. A theorem is a sentence that is the last entry in a proof. A theory is a set of theorems. So PA is the set of theorems derivable from the axioms of PA.
A theory is consistent if and only there is no sentence in the theory such that both it and its negation are members of the theory, which is to say that there is no sentence such that both it and its negation are theorems of the theory.
A theory is complete if and only if for any sentence, either it or its negation is a theorem.
Note that any inconsistent theory is complete, since an inconsistency proves every sentence.
The incompleteness theorem pertains to many theories, but in this thread we are looking in particular at PA, so the incompleteness theorem for PA is: If PA is consistent then PA is not complete. (To simplify discussion, throughout I will assume that PA is consistent. With the assumption that PA is consistent, the incompleteness theorem is: PA is incomplete.)
Godel showed 1-1 functions having pairwise disjoint ranges:
g from the set of symbols into w
g' from the set of sequences of symbols into w
g'' from the set of sequences of sequences of symbols into w
For any symbol, sequence of symbols, or sequence of sequences of symbols it is computable what its value is per the functions, and for any natural number it is computable what its symbol, sequence of symbols, or sequence of symbols is, if any, per the inverses of the functions.
For any s that is a symbol, sequence of symbols, or sequence of sequences of symbols, we may refer to #(s), which is the value of s per the pertinent function. We call #(s) "the Godel number of s".
/
(Throughout, by 'sentence', 'proof', and 'theorem' I mean of PA.)
Godel then showed how such predicates as 'is a sentence', 'is a proof', and 'provable' can be defined in the language of PA.
Then Godel showed a particular sentence, call it 'G', such that G <-> not-provable(#(G)), that is, #(G) is not the Godel number of a theorem of PA, which is to say that G is not a theorem. Moreover, the negation of G is not a theorem, since it is a theorem if and only if it is not a theorem, which is impossible. So there is a sentence such that neither it nor its negation is a theorem, which is to say that PA is incomplete.
/
But to PA we can add G itself as an axiom. Call this theory PA'. And PA' is consistent, but there is a sentence G' of PA' such that neither G' nor its negation are theorems of PA'. Ad infinitum.