Arithmetic transfinite induction and recursive well-orderings (Q1071019)

Let T be any of the following intuitionistic theories: higher order arithmetic (HAH), set theory (ZFI), or its extensions equiconsistent with large cardinals. For these T the following main results are derived by means of a uniform algebraic proof: 1. For every arithmetic sentence, provable in T there is a numeral n such that T proves that n is an index of a recursive well-founded proof tree for A (Th.3.1). 2. There is an arithmetic formula B(n) with n free, such that any primitive recursive relation on \(\omega\), for which T proves transfinite induction TI(R,B) for B(n), i.e. \(\forall n(\forall m(mRn\to B(m))\to B(n))\to \forall nB(n)\), is well-founded (Th.4.1).