COMP 426 Automated Reasoning
Lecture 9: Sequent Calculus
We will prove several examples in the sequent calculus and discuss possible sources of non-determinism when applying the inference rules. This will provide us with good intuition for how to search for normal deductions in a purely bottom-up fashion.
In the second part of the lecture, we will prove soundness of the sequent calculus with respect to normal proofs in natural deduction. This will again illustrate the proof technique of structural induction.
- Reading: in preparation
- Code: in preparation
- Previous lecture: Lecture 8
- Next lecture: Lecture 10
[ Home
| Schedule
| Assignments
| Projects
| Handouts
| Software
| Overview
]
bp@cs.mcgill.ca
Brigitte Pientka
|