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

A.A. 2024/2025 A.A. 2023/2024 A.A. 2022/2023 A.A. 2021/2022 A.A. 2020/2021 A.A. 2019/2020 A.A. 2018/2019 A.A. 2017/2018 A.A. 2016/2017 A.A. 2015/2016 A.A. 2014/2015 A.A. 2013/2014 A.A. 2012/2013 A.A. 2011/2012 A.A. 2010/2011 A.A. 2009/2010

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 magistrale in Mathematics - Enrollment from 2025/2026

The 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

ModulesCreditsTAFSSD
12
B
MAT/05
6
B
MAT/07
12
B
MAT/03
Un insegnamento a scelta
6
B
MAT/02
6
B
MAT/02
Un insegnamento a scelta
12
C
MAT/08
12
C
MAT/04
Un insegnamento a scelta
6
B
MAT/01
6
B
MAT/05

2° Year  activated in the A.Y. 2012/2013

ModulesCreditsTAFSSD
6
C
INF/01
Un insegnamento a scelta (insegnamenti seminariali ad esclusione di Psicologia dell'educazione e Matematica finanziaria)
6
C
MAT/03
6
C
M-PSI/04
6
C
MAT/06
6
C
MAT/01
6
C
MAT/08
6
C
MAT/06
6
C
MAT/02
6
C
MAT/08
6
C
MAT/02
6
C
MAT/09
Un insegnamento a scelta
6
C
MAT/01
6
C
MAT/09
Prova finale
32
E
-
ModulesCreditsTAFSSD
12
B
MAT/05
6
B
MAT/07
12
B
MAT/03
Un insegnamento a scelta
6
B
MAT/02
6
B
MAT/02
Un insegnamento a scelta
12
C
MAT/08
12
C
MAT/04
Un insegnamento a scelta
6
B
MAT/01
6
B
MAT/05
activated in the A.Y. 2012/2013
ModulesCreditsTAFSSD
6
C
INF/01
Un insegnamento a scelta (insegnamenti seminariali ad esclusione di Psicologia dell'educazione e Matematica finanziaria)
6
C
MAT/03
6
C
M-PSI/04
6
C
MAT/06
6
C
MAT/01
6
C
MAT/08
6
C
MAT/06
6
C
MAT/02
6
C
MAT/08
6
C
MAT/02
6
C
MAT/09
Un insegnamento a scelta
6
C
MAT/01
6
C
MAT/09
Prova finale
32
E
-
Modules Credits TAF SSD
Between the years: 1°- 2°
Altre attivita' formative
4
F
-
Between the years: 1°- 2°
12
D
-

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.

A Basic activities
B Characterizing activities
C Related or complementary activities
D Activities to be chosen by the student
E Final examination
F Other training activities
S Placements in companies, public or private institutions and professional associations

Mathematics methods for computer science (2012/2013)

Teaching code

4S02855

Credits

6

Coordinator

Ugo Solitro

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Seminars 0

The teaching is organized as follows:

Parte 2

Credits

3

Period

I semestre

Academic staff

Gianluigi Bellin

Parte 1

Credits

3

Period

I semestre

Academic staff

Ugo Solitro

Learning outcomes

An introduction to the theory of computability and to computational logic.

Program

Module: Computability.
-------

Introduction.
Automata, languages and grammars. Main results.

Computability.
Algorithms. Models for the effective computations: Turing machines, partial recursive functions, ...
Main results. Church Thesis. Arithmetization and Universality. Unsolvable problems.
Mathematical theory of recursion.

Complexity.
Complexity classes. NP-completeness.



-------------------

Module: Computational Logic.
-------

Representation of proofs and algorithms.

Sequent calculi, cut elimination, semantic tableaux. Intuitionistic Natural Deduction.

Lambda calculus, Church-Rosser property. Representation of partial recursive functions. Simple types and typability.

Curry-Howard correspondence and weak normalization theorem for simply typed lambda calculus. Further advanced topics.

Bibliography

Reference texts
Activity Author Title Publishing house Year ISBN Notes
Parte 1 John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman Introduction to Automata Theory, Languages and Computation (Edizione 2) Addison-Wesley 2000 0201441241 testo di riferimento

Examination Methods

The exam consists in a test for every module and a final oral examination.

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE