15-815 Automated Theorem Proving
Lecture 5: Deciding Propositional Logic
In this lecture we complete our discussion of Dyckhoff's contraction
free sequent calculus and the decision procedure for intuitionistic
propositional logic it generates.
We then discuss how to define negation via introduction and
elimination rules, and formulate a corresponding sequent calculus.
This will provide us with the means to discuss how classical logic
fits into the picture and provide a judgmental explanation and
a sequent calculus for classical logic in the next lecture.