Next: About this document
CS486 Spring 1997
Lecture 26 Tuesday, April 29, 1997
- Review
- partial operations
- well-formedness of propositions
- Formal courseware and Nuprl demo
- Caldwell library on propositional logic
(Browser vs Nuprl system)
- other libraries
- Programming Logics
- total and partial functions
- termination conditions
- halting problem
- abstract Gödel theorem
- Nuprl demo today
structure editing, hypertext, elision
interactive proof
formalizing counting
value of active formalism?
Next time more on Gödel's theorem and notation for partial functions, 
.