Next: About this document
CS486 Spring 1997
Lecture 19 Thursday, April 3, 1997
Please read Suppes Chapter 3
- Discuss projects
- nature of project
- list of possibilities
- learning Nuprl
- Computationally meaningful statements and proofs
- the recursive function definitions in
are computable
- Boolean valued functions versus propositions, e.g.
vs 
vs 
- Bates/Constable paper
- Set Theory Basics
- conditional definition (
solution)
- union, sun, intersections
- abstraction:
- pairing, Cartesian products
- power sets
- Natural Numbers as sets
- transitive sets and ordinals (see handout)