This is a beginning graduate-level class in mathematical logic with motivation
provided by applications in Computer Science. Topics include:
propositional and first-order logic; soundness, completeness, and compactness
of first-order logic; first-order theories; undecidability and Godel's
incompleteness theorem; and an introduction to other logics such as
second-order and temporal logic.
The prerequisite is analysis of algorithms or consent of instructor.
Note that the pace of the course will require students with a significant level
of mathematical sophistication. They should be especially familiar with sets,
functions, proofs, and abstract reasoning.
Enderton, Herbert B. A Mathematical Introduction to Logic,
Monday 5:00-7:00pm in room 513 of Warren Weaver Hall.
Final grades will be based on the following:
40% Weekly Assignments
30% Midterm Exam