Quick cut-elimination for strictly positive cuts
Logic
2013-04-11 v2
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.
Cite
@article{arxiv.1010.4111,
title = {Quick cut-elimination for strictly positive cuts},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:1010.4111},
year = {2013}
}