LIACS > Marcello M. Bonsangue > Introduction to Logic (I&E)
Lecturer Marcello Bonsangue
Assistant ???
ECTS 6
Course number
4032IELOG
Prerequisites Fundamentele Informatica 1
Language English
Examinations
11 June 2018, 13:30-16:30, room t.b.a. (activity ???)
12 July 2018 13:30-16:30,  
room t.b.a. (activity ???)
Schedule Spring 2018

February
6, 9, 13, 156, 20, 23, 27, 30
March
6, 9, 20, 23, 27
April
3, 6, 10, 13, 17, 20, 24, 31
May
4, 8, 15, 18, 25
June 1

Lectures: 13:30-15:15, room t.b.a.

Practica: 09:00-10:45 room t.b.a.

Goal

This course gives an introduction to the field of mathematical logic by presenting the syntax and semantics of propositional logic and of the richer language of predicate logic. The goal is to describe and investigate the above logics by finitary methods, and to train students in formalizing specifications and in verifying properties of systems.


Description

Originally logic was used by the Greek Sophists to demonstrate the correctness of their argument in formal debates. The ambiguity of human languages asked for formulation of logic in a symbolic formal language.


Only towards the end of the 19th century logic has been formulated in the language of mathematics, and in particular of algebra, making it a useful tool to solve mathematical problems. In the same period the language used to prove theorems from mathematics begun suffering the same problems of natural language, showing many paradoxes. Logic was proposed as the foundational language of mathematics, but several limitation where soon discovered.

More recently logic has become the language of computer science, just as calculus is the language of many engineering discipline. In this course we will study propositional and predicate logic, their proof theory, their limitation, as well as some of their applications in computer science.


Literature

Here the image of the book
Michael R. A. Huth and Mark D. Ryan Logic in Computer Science: Modelling and Reasoning about Systems, Cambridge University Press, 2004 (ISBN 052154310X).

Schedule lectures

Nun Date Topic Reading Extra


Bibliography

[BDKLM03] J.F.A.K. van Benthem, H.P. van Ditmarsch, J. Ketting, J.S. Lodder, and W.P.M. Meyer-Viol. Logica voor informatica, derde editie Pearson Education, 2003.

[HR04] Michael R. A. Huth and Mark D. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems, Cambridge University Press, 2004.

[Kup05] Jan Kuper. Overview of proposition and predicate logic, notes 2005.

[V03] Moshe Vard.i A Brief History of Logic, 2003.

LaTeX and proofs

For writing natural deduction proofs in LaTeX you can use Paul Taylor's macro's voor proof boxes. Here is an example of a proof in natural deduction from the book in .tex en .pdf.

Exam and homework information

  • Examination is worth 70% of the final grade (with a minimum of 5.5). The remaining 30% is from the average grade of theof the 4 best out of the 5 homeworks.

  • Write clearly your name and student number in your homework solution.
  • Return your homework solution as a single pdf file by email to ???.
  • Name your pdf file containing the solution as HWxxNameSurname.pdf, where xx ranges from 1 to 5 and it is the number of homework.
  • Solutions sent after the deadlines are not accepted.
  • Grades  of the homeworks will be published on blackboard.


Past examinations