Syllabus (tentative)

Week 1 - Introduction to Informal Logic

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 2 - The Syntax of Propositional Logic

Lecture notes: PDF.

Exercises for tutorial: PDF.

Support application 1 - determines whether a string is a PL formula.

Support application 2 - determines and explains the subformulae of a PL formula.

Support application 3 - computes the abstract syntax tree (ast) of a PL formula.

Support application 4 - computes (and explains) the height of (the ast of) a PL formula.

Support application 5 - computes (and explains) the size of (the ast of) a PL formula.

Support application 6 - computes (and explains) the set of propositional variables occuring in a PL formula.

Week 3 - The Semantics of Propositional Logic

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 4 - Natural Deduction

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 5 - Normal Forms

Lecture notes: PDF.

Exercises for tutorial: PDF.

Support application 7 - computes the abstract syntax tree of a PL formula without all brackets based on the priority of the logical connectives.

Week 6 - Resolution

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 7 - Tseitin's Algorithm

Lecture notes: PDF.

Exercises for tutorial: PDF.

BONUS! Review questions: PDF

Week 8 - Midterm Exam

Week 9 - Syntax of first-order logic

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 10 - Semantics of First-Order Logic

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 11 - Natural Deduction

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 12 - Normal Forms

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 13 - Ground Resolution

Lecture notes: PDF.

Exercises for tutorial: PDF.

Week 14 - Unification and First-Order Resolution

Lecture notes: PDF.

Exercises for tutorial: PDF.

Review questions for the exam