15-815 Automated Theorem Proving
Lecture 13: Completeness of the Inverse Method

In this lecture we will attempt to give a completeness proof of the inverse method for first-order intuitionistic logic. The proof will follow the one by Degtyarev and Voronkov [DV01a]. Note the corrigendum to replace pages 200 and 201.

Time permitting, I will also discuss proof terms for first-order logic and give a brief introduction to type theory.

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

Frank Pfenning