Source: wikibot/cut-elimination-theorem
= Cut-elimination theorem
{wiki=Cut-elimination_theorem}
The Cut-Elimination Theorem is a fundamental result in proof theory, particularly in the context of sequent calculus and formal systems. It asserts that any proof in a certain logical system that includes the use of "cut" inference rules can be transformed into a proof that does not use these cut rules, thus ensuring that the proof is "cut-free.