15-815 Automated Theorem Proving
Lecture 18: Completeness of Labeled Deduction

In this lecture we prove completeness of labeled deduction for intuitionistic propositional logic. The critical idea is to identify monotone sequents where labels on the right hand side are all equal, and every label on the left is a prefix of the label on the right. The completeness proof is more difficult and we will not cover it in this course.

[ Home | Schedule | Assignments | Handouts | Software | Resources ]

Frank Pfenning