Quick cut-elimination for strictly positive cuts

In this paper we show that the intuitionistic theory I D ̂ < ω i ( S P ) for finitely many iterations of strictly positive operators is a conservative extension of Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic.