LOGIC IN COMPUTER SCIENCE
The course will cover the logic of programs, epistemic logic, the logic of games, belief revision, and if time permits, other topics to be specified later.
Program correctness and Hoare Logic
The Temporal Logic of Programs
Epistemic Logic (logic of knowledge)
Public announcements and Plaza’s result
Agreeing to disagree and the results of Aumann, Krasucki and Parikh
The no-trade theorem of Milgrom and Stokey
Belief revision and the AGM theory
Other topics as appropriate
Students will learn how to prove the correctness of simple programs
Students will be able to state important results in various areas.
Students will be able to prove the simplest results in these areas
Students will be able to compute the states of knowledge in simple scenarios
Students will do home works (typically every week) making sure they understand the material covered in each class. There will be a midterm examination and after that the students will be given the option of writing a term paper and taking a final examination.