15-317 Constructive Logic
Lecture 13: Arithmetic
In this lecture we introduce first-order intuitionistic
arithmetic (also called Heyting arithmetic), which is
based on the schemas of primitive recursion and induction
from the previous lecture, but also includes equality on
natural numbers and the previously introduced quantifiers.
We go through several example proofs and their formalization.
- Reading: none
- Previous lecture: Induction
- Next lecture: Logic Programming
- Key concepts:
- Equality introduction and elimination rules
- Equational specifications