The class offers an introduction to logic as a tool for rational inquiry and abstract thinking, and as a foundation of computer science.
Students get exposure to logical languages, learning how to understand, express, and connect concepts in this languages.
Students learn how to build models and proofs of logical formulae in one or more deductive systems, both manually and interactively at the computer.
They acquire the skills to understand, formulate, and assess formal arguments expressed in one or more logics, as well as the preparation to pursue further studies in artificial intelligence and theory of computing.
The language of propositional logic: atoms, connectives, sentences. The language of first-order logic: constant symbols, function symbols, and predicate symbols. Methods of proof, interpretations and models for propositional reasoning. The language of first-order logic: variable symbols, quantifiers, formulas, sentences. Methods of proof, interpretations and models for reasoning with quantifiers. Set theory. Arithmetic. Induction principles. Horn logic. Resolution, Skolemization, and unification. Completeness and incompleteness.
| Author | Title | Publisher | Year | ISBN | Note |
| Dave Barker-Plummer & Jon Barwise & John Etchemendy | Language, Proof and Logic (Edizione 2) | CSLI Publications | 2011 | 978-1-57586-632-1 |
First round: the grade is given by 25% C1 + 25% C2 + 50% P, where C1 is the midterm exam, C2 is the final exam, and P is the average of the grades in the homeworks.
Later rounds: the grade is given by 100% E, where E is a written exam, as hard as midterm, final, and homeworks combined.
Attending all classes is crucial, however attendance or lack thereof does not determine different exam rules.
All grades will be registered; it is possible to withdraw by informing the instructor.
