15399 Constructive Logic
Lecture 4: Linear and Normal Deductions
The twodimensional display for inference rules and proofs is used
almost universally in logic and computer science. However, it is not
well suited for writing down actual proofs. We therefore introduce
a concrete syntax for proofs which can be checked by the software
available to use in this course.
We also 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 bottomup and elimination
rules topdown.
[ Home
 Schedule
 Assignments
 Handouts
 Software
 Overview
]
fp@cs
Frank Pfenning
