This methods implements a version of Gentzen's cut-elimination proof using the (known to be terminating) strategy of reducing a left-uppermost cut.
This methods implements a version of Gentzen's cut-elimination proof using the (known to be terminating) strategy of reducing a left-uppermost cut. The algorithm terminates when all cuts have been eliminated.
The proof to subject to cut-elimination.
The cut-free proof.
This method checks whether a proof is cut-free.
This method checks whether a proof is cut-free.
The proof to check for cut-freeness.
True if proof does not contain the cut rule, False otherwise.
This object implements a version of Gentzen's cut-elimination proof for our sequent calculus LK. For details, please refer to the documentation of the apply methods.