Quick cut-elimination for strictly positive cuts

From MaRDI portal
Publication:639680

DOI10.1016/J.APAL.2011.03.002zbMATH Open1273.03158arXiv1010.4111OpenAlexW1963953353MaRDI QIDQ639680FDOQ639680


Authors: Toshiyasu Arai Edit this on Wikidata


Publication date: 22 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1010.4111




Recommendations




Cites Work


Cited In (4)





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)