15-317 Constructive Logic
Lecture 17: Sequent Calculus

In this lecture we move from a concrete Prolog program for proof search to the more abstract sequent calculus, which is an almost universal foundation for various different forms of proof search procedure. It is in close correspondence to verifications, except that all rules work in a bottom-up style, applying either to hypotheses (to model elimination rules) or to the conclusion (to model introduction rules).

• Reading: atp:ch3-seqcalc.pdf, Sec 3.3
• Previous lecture: Propositional Theorem Proving
• Next lecture: Cut Elimination
• Key concepts:
  • Right and left rules
  • Weakening and contraction
  • Connection between verifications and sequent derivations

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning