Quick cut-elimination for strictly positive cuts
classification
🧮 math.LO
keywords
arithmeticcut-eliminationheytingpositivequickstrictlyappliedconservative
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.