15-317 Constructive Logic
Lecture 12: Propositional Theorem Proving

In this lecture we further refine the restricted sequent calculus to a so-called contraction-free formulation, where the premises of all rules are smaller than the conclusion. This allows for a simple decision procedure which can be made practical by considering which rules can be applied asynchronously.