I am working through the above mentioned book, 'proof theory and logical complexity, volume 1', with some trouble here and there.
I would be glad if someone can help me with some of the exercises, clarify things when I can't work out the sense/meaning or help with the understanding of the proofs.
This is about example 1.4.6, I really have major problems here.
1) The author uses the word 'containing' in the first line. Apparently here he does not have in mind the definition of containment which comes RIGHT BEFORE this example, but instead he just means 'the axioms of EA and induction'. Right?
2) I don't see how to use theorem 1.3.5 to prove that PA contains PRA. (Here he uses the word 'contains' in accordance with his definition.)
3) I don't see what role is played by the chinese remainder theorem. I don't need to see a proof of it, and of course I can look it up online, but I don't see how it is used here, in this case, what exact formulation would be necessary etc.
4) What about the formula Prm(x,i,z)? What if x does NOT encode a sequence or i>=n. Then I guess the formula is supposed to be true, right?`
5) I have no idea what the long formula after 'The interpretation of $A_{Rfg}$ is' is saying and it is to me not at all 'immediate' that the interpretations of axioms (ix) and (x) hold.
6) When he tells why PA is prim. rec., in the end, why does he skip axiom (xv) of EA? Wouldn't it be necessary to include it?
Thanks a lot for your help, Regards,
Ettore