Here is a list of the topics covered in each lecture, with the corresponding textbook sections. We will adjust this schedule as required.

L01 | Tu Jan 7 | Notes, page 1-30 | What is logic? Logic propositions and connectives | ||

L02 | Th Jan 9 | Notes, page 31-49 | Truth tables; Translations from English into propositional logic | [Lu] 2.1 | |

L03 | Tu Jan 14 | Notes | Well-formed propositional logic formulas; Structural induction | [Lu] 1.2, 2.2, 2.3 | |

L04 | Th Jan 16 | Notes, pages 1-23 | Propositional calculus, semantics: value assignments, satisfiability |
[Lu] 2.4, 2.5 | Quiz 1; Assignment 1 posted |

L05 | Tu Jan 21 | Notes, pages 24-45 | Proving arguments valid in propositional logic | [Lu] 2.5 | |

L06 | Th Jan 23 | Notes, pages 1-20 | Propositional calculus laws; Disjunctive and Conjunctive Normal Forms |
[Lu] 2.7 | Assignment 1 due tomorrow |

L07 | Tue Jan 28 | Notes, pages 21-27 | How to obtain DNF and CNF from truth tables | [Lu] 2.7 | |

Notes | Adequate set of connectives; Boolean Algebra; Logic gates |
[Lu] 2.8 | |||

L08 | Thu Jan 30 | Notes | Logic circuit design; Circuit minimization; Analysis and simplification of code | ||

L09 | Tue Feb 4 | Problem Solving Session | |||

L10 | Thu Feb 6 | Notes, pages 1-28 | Formal (natural) deduction |
[Lu] 2.6 | Assignment 2 due tomorrow |

L11 | Tue Feb 11 | Notes, pages 29-- | Soundness and completeness of formal deduction |
[Lu] 2.6 | |

L12 | Thu Feb 13 | Notes | Automated theorem proving by resolution; Davis Putnam Procedure |
Quiz 2; Assignment 3 posted | |

Feb. 17-21 |
Reading Week |
||||

L13 | Tue Feb. 25 | Notes | Predicate logic; Quantifiers |
[Lu] 3.1 | Assignment 3 due today |

L14 | Thu Feb. 27 | Notes | Logic and DNA Computing | ||

Notes | Solving Satisfiability with DNA |
Midterm today, 4:30-6:20 |