Quick cut-elimination for strictly positive cuts

From MaRDI portal
Publication:639680




Abstract: In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of the 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.









This page was built for publication: Quick cut-elimination for strictly positive cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639680)