Quick cut-elimination for strictly positive cuts

Details Quick cut-elimination for strictly positive cuts Quick cut-elimination for strictly positive cuts

2010-10-20

arxiv.org/abs/1010.4111v2

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quick cut-elimination for strictly positive cuts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quick cut-elimination for strictly positive cuts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quick cut-elimination for strictly positive cuts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717037