Theory | Structural Proof

(and its assumptions). This is vital for creating automated decision procedures in computer science. 3. Applications and Significance

: A direct consequence of cut-elimination, this property ensures that a normal proof of a formula only contains subformulas of Structural Proof Theory

The field is defined by two primary systems developed by in the 1930s: (and its assumptions)

: It underpins the Curry-Howard Correspondence , which relates logical proofs to computer programs. Structural Proof Theory

: Gentzen's most famous result, which states that any proof containing a "cut" (a detour or lemma) can be transformed into a cut-free (or normal) form.