On the computational complexity of cut-reduction

Details On the computational complexity of cut-reduction On the computational complexity of cut-reduction

2007-12-10

arxiv.org/abs/0712.1499v1

Computer Science

Logic in Computer Science

41 pages, technical report (CS, Swansea University)

Scientific paper

Using appropriate notation systems for proofs, cut-reduction can often be
rendered feasible on these notations, and explicit bounds can be given.
Developing a suitable notation system for Bounded Arithmetic, and applying
these bounds, all the known results on definable functions of certain such
theories can be reobtained in a uniform way.

Affiliated with

Also associated with

No associations

Rating

On the computational complexity of cut-reduction 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 On the computational complexity of cut-reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the computational complexity of cut-reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405593