[FOM] Is Con_Q provable in Q?

[Arnon Avron]

In all texts I know about Godel second incompleteness theorem (the
theorem about consistency proofs), it is proved for theories which
are "strong enough", where "strong enough" means: consistent axiomatic
extensions of PRA. My intuition, which is not very reliable, tells me
that the theorem should apply also to weaker theories, for example: to
Robinson's arithmetics Q. Can anybody give me references to works 
which might be relevant to this question?

Thanks

Arnon Avron

School of CS
Tel-Aviv University