By famous KPT theorem, if $\mathsf{T^i\_2}\vdash \mathsf{T^j\_2}$ for some $0<i<j$, then the polynomial hierarchy collapses. So it seems this bounded arithmetic hierarchy does not collapse. Also, conservative results for some classes of formulas lead to collapsing complexity classes which is not expected. 
My question is about the $ \mathsf{T^i\_2+EXP}$ theories.



> 
> Q1. What is the relationship between $\mathsf{T^i\_2+EXP}$ and $\mathsf{T^j\_2+EXP}$ for $i<j$? Is it true that $\mathsf{T^i\_2+EXP\vdash T\_2}$?
> 
> 
> 


Separating these theories implies separating bounded arithmetics which it seems to be hard.



> 
> Q2. What about conservative results? For example does $\mathsf{T^i\_2+EXP}$ proves every $\Pi\_2$ sentences of $\mathsf{T\_2+EXP}$?
> 
> 
> 


Thanks in advance.



On subtheories of $\mathsf{T_2+EXP}$
All these theories coincide: if exponentiation is total, a bounded formula is equivalent on any bounded domain to a sharply bounded formula (with an exponentially large parameter), hence bounded induction follows from sharply bounded induction, i.e., $T^0\_2+\mathrm{EXP}=T\_2+\mathrm{EXP}$.


