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

15-815 Automated Theorem Proving


Lecture 30: Cut Elimination with Equality

We finish the proof that regular derivations are complete for the sequent calculus with equality and then prove the cut elimination theorem for regular derivations.

The resulting system can be reformulated by residuating equality constraints, except that these equality constraints now may depend on equational assumptions. Theorem proving in this simple logic is called rigid E-unification. We also discuss the more general problem of E-unificaiton. Unfortunately, both problems are undecidable.

Reading

Key Concepts

Links

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


Frank Pfenning
fp@cs