Next: About this document
CS486 Spring 1997
Lecture 23 Thursday, April 17, 1997
- Recursive types
- examples: lists, trees, expressions, formulas
- ordinal arithmetic (Suppes, p.195-203, 224-227)
- fixed points (see handout)
- rules sets,
, least -closed sets, 
- defining lists in set theory
- CS critique of classical set theory
- cannot express computability
- cannot express explicit data
- inductive sets are awkward
End of set theory section of course