15-317 Constructive Logic
Lecture 12: Induction

In this lecture we finish the discuss the introduction and elimination rules for natural numbers. The latter is a constructive formulation of the principle of mathematical induction. When we eliminate within the typing judgment we obtain the schema of primitive recursion. In that way, primitive recursion is related to the principle of mathematical induction under the identification of propositions with types.

• Reading: none
• Previous lecture: Classical Quantification
• Next lecture: Arithmetic
• Key concepts:
  • Natural number introduction and elimination
  • Primitive recursion
  • Recursive computation
  • Induction

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning