COMP 426 Automated Reasoning
Lecture 7: Intercalation
So far we have employed an informal strategy of using introduction rules bottom-up and elimination rules top-down. In this lecture, we will make this strategy more precise, and prove correctness of this new strategy.
We will explain the important proof technique of structural induction.
- Reading: in preparation
- Code: in preparation
- Previous lecture: ??
- Next lecture: ??
[ Home
| Schedule
| Assignments
| Projects
| Handouts
| Software
| Overview
]
bp@cs.mcgill.ca
Brigitte Pientka
|