Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea in Informatica - Enrollment from 2025/2026The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
| Modules | Credits | TAF | SSD |
|---|
Mathematical analysis 1
Computer Architecture
2° Year activated in the A.Y. 2018/2019
| Modules | Credits | TAF | SSD |
|---|
3° Year activated in the A.Y. 2019/2020
| Modules | Credits | TAF | SSD |
|---|
One course to be chosen among the following| Modules | Credits | TAF | SSD |
|---|
Mathematical analysis 1
Computer Architecture
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
One course to be chosen among the followingLegend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Logic [Cognomi M-Z] (2017/2018)
Teaching code
4S00084
Academic staff
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I sem. dal Oct 2, 2017 al Jan 31, 2018.
Learning outcomes
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, such as those of propositional logic and first-order logic, as well as languages of specific theories, such as arithmetic and set theory, and learn how to express concepts in this languages. Students learn how to build models and proofs, both manually and using software tools, thus acquiring a solid understanding of the notions of satisfiability and validity that capture truth in logic.
Program
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 | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| Dave Barker-Plummer & Jon Barwise & John Etchemendy | Language, Proof and Logic (Edizione 2) | CSLI Publications | 2011 | 978-1-57586-632-1 |
Examination Methods
First round: the grade is given by 25% I + 25% F + 50% H, where I is the midterm exam grade, F is the final exam grade, and H is the average of the grades in the homeworks. For the first round, all grades will be registered; however, it is possible to withdraw by informing the instructor.
Later rounds: the grade is given by 100% P, where P is a written exam, as hard as midterm, final, and homeworks combined.
Note: Attending all classes is crucial, however attendance or lack thereof does not determine different exam rules.
