The cut (English cut or cut -rule ) is a transitive rule in the logic of linear programming and the constraint programming.

If in a derivation or a search tree an avoidable transitive "detour" made, this detour is wegschneidbar.

In the logic section

In the logic calculi is the cut rule of modus ponens metalogischer on stage and reads as follows:

The fact that the cut rule is valid and eliminated in the Gentz ​​type calculi, says the Gentzensche law.