Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination

Details Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination

1996-07-05

arxiv.org/abs/math/9607204v1

Mathematics

Logic

Scientific paper

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting mathematical structure. In particular we try to indicate some dynamical and combinatorial aspects of cut elimination, as well as its connections to complexity theory. We discuss two concrete examples where one can see the structure of short proofs with cuts, one concerning feasible numbers and the other concerning "bounded mean oscillation" from real analysis.

Affiliated with

Also associated with

No associations

Rating

Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination 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 Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-81152