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.
Recommendations
Cites work
- scientific article; zbMATH DE number 2051382 (Why is no real title available?)
- An intuitionistic fixed point theory
- Fragments of HA based on \(\Sigma_ 1\)-induction
- Fragments of Heyting arithmetic
- Intuitionistic Fixed Point Theories for Strictly Positive Operators
- Intuitionistic fixed point theories over Heyting arithmetic
- Relativized realizability in intuitionistic arithmetic of all finite types
- Some results on cut-elimination, provable well-orderings, induction and reflection
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)