15-399, 80-317/617
Constructive Logic
Lecture 8: Normal Deductions
We formalize our strategy for proof search by introducing
two new judgments: A has a normal proof, and A has a neutral
proofs. Intuitively, a proof is normal if it can be found by
our strategy to apply introduction rules bottom-up and elimination
rules top-down. These notions will be used in analyzing proofs as programs.
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Overview
]
|