CS486 Spring 1997

Lecture 27 Thursday, May 1, 1997

• Review
  • notation for partial functions ()
  • halting problem inside Type Theory
• Gödel's Theorem
  • specific 1931 result
    (see Gödel book), Gödel numbering, provability
  • relationship to abstract Gödel theorem and halting problem
    creative and productive sets
    
  • philosophical issues
    foundational battles (Intuitionism, Formalism, Logicism)
    Hilbert Program
• Conclusion
  • applied Logic and CS
  • Cornell research areas
  • applied Logic and AI
• Final Exam
  • Thursday, May 15, 1997, 9:00 AM, Thurston 202
  • review session: Wednesday, May 14, 1997, 3:00-4:00 PM, 5135 Upson Hall

• About this document ...