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 |
|---|
2° Year activated in the A.Y. 2017/2018
| Modules | Credits | TAF | SSD |
|---|
One course to be chosen among the following3° Year activated in the A.Y. 2018/2019
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
One course to be chosen among the following| Modules | Credits | TAF | SSD |
|---|
Legend | 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 (2016/2017)
Teaching code
4S00084
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
I sem. dal Oct 3, 2016 al Jan 31, 2017.
Learning outcomes
Objective of the course is the learning of logic, and specifically classical logic, both propositional and first-order, as the lingua franca of the symbolic sciences and especially computer science. The student becomes proficient in formalizing natural language sentences into logical formulae, and learns to build proofs, both manually and interacting with an interactive theorem prover, and to build models, both manually and interacting with a model builder.
Program
Proposiitonal logic and its language. First-order logic and its language. Examples of theories, such as arithmetic and set theory. What is a proof. Proof methods. Proof by contradiction. Natural deduction. Resolution. What is a model. Model building. Set theory. Induction.
| 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
Exams (First take):
The grade is given by 30% C1 + 30% C2 + 40% P, where C1 is the midterm exam, C2 is the final exam, and P is the average of the grades in the homeworks.
Exams (Later takes):
The grade is given by 100% E, where E is a written exam, as hard as midterm, final, and homeworks combined.
There is no difference between students who attend and students who do not attend.
