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. 2022/2023
| Modules | Credits | TAF | SSD |
|---|
3° Year activated in the A.Y. 2023/2024
| Modules | Credits | TAF | SSD |
|---|
1 module among the following| Modules | Credits | TAF | SSD |
|---|
Mathematical analysis 1
Computer Architecture
| Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
1 module 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 [Matricole pari] (2021/2022)
Teaching code
4S00084
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
Primo semestre dal Oct 4, 2021 al Jan 28, 2022.
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, 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. 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.
Program
Propositional Logic
Propositions and Connectives,
Semantics,
Natural Deduction,
Soundness, Completeness
PredicateLogic
Quantifiers
Structures
The Language of a Similarity Type
Semantics,
Identity,
NaturalDeduction
Soundness, Completeness
Natural Deduction and Identity
Formalisation of properties in predicate logic.
Properties and functions of the natural numbers e.g.:
“n is a prime number”, “m is the sum of two natural numbers”, etc.
Mathematical theories
Bibliography
Examination Methods
The exam consists of two parts.
Part I:
Multiple choice test with 15 questions. A total score of at least 10 is required to pass the test. The final score is obtained by summing up the numerical evaluation of each answers assigned as follows: 1 for every correct answer, -0.5 for every incorrect answer, 0 for no answer.
Part II:
Only students who pass Part I can access this part. This consists of a written test with 5 open questions on theorems, proofs and exercises related to the topics covered by the lectures.
A score of 7 is assigned to each correct answer. A final score exceeding 30 is eligible for a cum laude qualification.
