I have two questions actually.
Gödel's theorem is usually stated as applying to theories that are at least as strong as Peano's Arithmetic. But I've read that Robinson's Arithmetic (weaker than PA) is also subject to incompleteness, so I guess the hypothesis of Godel's theorem can be relaxed to apply to weaker theories than PA. What's the weakest theory to which it applies ?
Second question, Godel's theorem itself is proved in some mathematical theory. What theory is this ? I think it can be done in Robinson's Arithmetic but can it be done in even weaker theories ? Are these theories strong enough so that Godel's incompleteness applies to them ? Or can they prove their own consistency ?