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

15-815 Automated Theorem Proving


Lecture 31: Residuating Equational Constraints

After finishing the proof of cut elimination which heavily relies on the completeness of regular derivations, we residuate equational constraints. This is similar to the same process for the logic without equality, except that now implicational formulas may arises in the residuated constraints. The corresponding problem is called simultaneous rigid E-unification.

Reading

Key Concepts

Links

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


Frank Pfenning
fp@cs