Logic (Summer 2011)

Lecturer:		Dr. Danny Hermelin
Assistant:		Ido Nissenboim
Time:		Monday, 13-17 and Wednesday, 9-13
Rooms:		7038 Rabin building (Monday) and 207 Jacobs building (Wednesday)
Content:		This is a first course in logic for computer scientists. The general topics are propositional calculus, predicate calculus, temporal logic. The lectures are given in Hebrew.
Lecture details:		Title Details Link Formal Languages and Systems Motivations, brief historic account, formal languages, structural induction, formal systems. [pdf] Propositional Calculus Syntax, models and satisfiability, semantic deduction, normal forms. [pdf] Proofs in Propositional Calculus Syntactic deduction, deduction theorem, consistency, proof by contradiction theorem, soundness. [pdf] Completeness of Propositional Calculus Maximal consistency, completeness theorem. [pdf] Compactness of Propositional Calculus The compactness theorem, definability, coloring infinite graphs. [pdf] Predicate Calculus Syntax, models and satisfiability, normal forms. [pdf] Proofs in Predicate Calculus Axioms, syntactic deduction, generalization theorem, soundness. [pdf] Completeness of Predicate Calculus Closed and complete consistent sets, completeness theorem. [pdf] Compactness of Predicate Calculus Löwenheim-Skolem special case, definability, second order logic. [pdf]
Exercises:		Exercise 1 due on Sunday 7.8, in the exercise session. Exercise 2 due on Sunday 21.8, in the exercise session.