Essentially, a cut-free proof is a proof that does not use a lemma. That is:

Given , and we can cut from the proof of when is true. Here we consider to be the lemma in the proof of .

The ability to eliminate in the above is called the cut-elimination theorem.

For more information set http://en.wikipedia.org/wiki/Cut-elimination Cut-elimination

CutFreeProof (last edited 2020-01-26 23:16:51 by scot)