Article ID Journal Published Year Pages File Type
4662506 Annals of Pure and Applied Logic 2011 9 Pages PDF
Abstract

In this paper we show that the intuitionistic theory 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.

Related Topics
Physical Sciences and Engineering Mathematics Logic