Computation & Deduction
Spring 1997
Frank Pfenning

Lecture 17: Proof Search and Sequent Calculus

We conclude the discussion of the Curry-Howard isomorphism by considering quantifiers and natural numbers. The correspondence no longer works out perfectly, but programs can still be extracted from constructive proofs. We then return to the system of natural deduction and describe the process of proof search which will naturally lead to a sequent calculus, an alternative style of specification for logical systems. We will also give an overview over various suggested projects for this course.
  • next lecture
  • previous lecture

  • [ C&D Home | Schedule | Code | Assignments | Notes | Projects | Elf ]

    © Frank Pfenning 1992-1997