# Logic(s) for Computer Science 2018-2019 (Winter Semmester)

- Grading policy
- Written midterm examination (8th week): 45 points
- Written final examination (session): 45 points
- Attendance (tutorials): 10 points
- Bonus to be given at the discretion of the instructors for various activities (answers, implementations, etc.): at most 10 points
- At least 45p (out of 45+45+10+10) are required to get a passing grade
- Grades will be statistically distributed based on the number of points.
- How to Study
- Follow the announcements on the webpage of the course.
- Attend the lecture each week and pay attention.
- Review the lecture notes and/or study the additional bibliography for the week. You should ideally understand all material. Write down any questions you might have.
- Actively attend the tutorial (print the exercise sheet before). Solve the exercises given and/or ask questions. Solve the remaining exercises at home.
- If passionate about a topic, ask for extra bibliography.
- Do not learn by heart.
- Do not use older teaching material (it may change from one academic year to another).
- Contact
- Propositional Logic: Ștefan Ciobâcă - stefan.ciobaca@gmail.com
- First-Order Logic: Rodica Condurache - rodica.condurache@gmail.com

## 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

- PDF (ro)