Arithmetical reflection and the provability of soundness

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ProvPA(┌φ┐)→φ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory T or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory