CSE 230: Principles of Programming Languages
Notes on Appendix B of Algebraic Semantics (First Order Logic)

Well founded induction does require proving P(0): if we let x=0, then we get the implication true => P(0), which is equivalent to P(0), as our proof obligation for this case.

To CSE 230 homepage
To CSE 230 notes page
Maintained by Joseph Goguen
© 2000, 2001, 2002 Joseph Goguen
Last modified: Mon Feb 25 13:52:16 PST 2002