15-317 Constructive Logic
Lecture 6: Natural Numbers

In this lecture we introduce the data type of natural numbers as a prototype for other kinds of data structures. The introduction form let us construct natural numbers from zero and a successor function, the elimination forms model both proof by induction and function definition by primitive recursion. The resulting system is called intuitionistic arithmetic or Heyting arithmetic.

• Reading: 06-nat.pdf
• Key concepts:
  • Induction
  • Primitive recursion
  • Heyting arithmetic
• Previous lecture: Quantification
• Next lecture: Classical Logic

[ Home | Schedule | Assignments | Handouts | Software ]

fp@cs
Frank Pfenning