[ home | schedule | assignments | projects | resources | handouts | overview | links ]

15-815 Automated Theorem Proving


Lecture 23: Inverse Method with Quantifiers

After completing the discussion of classical logic, we generalize the inverse method to allow for quantifiers. This changes the nature of the sequents, which may now be locally parametric, and the basic inference mechanism, which now requires unification. We also extend the notion of subformula and naming in order to account for subterms with free variables.

Reading

Key Concepts

Links

[ home | schedule | assignments | projects | resources | handouts | overview | links ]


Frank Pfenning
fp@cs