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.

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/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.

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

ModulesCreditsTAFSSD
12
B
INF/01
6
C
FIS/01
6
B
ING-INF/05
12
B
ING-INF/05
Un insegnamento a scelta tra i seguenti:

3° Year  activated in the A.Y. 2013/2014

ModulesCreditsTAFSSD
12
B
INF/01
Un insegnamento a scelta tra i seguenti:
Prova finale
6
E
-
activated in the A.Y. 2012/2013
ModulesCreditsTAFSSD
12
B
INF/01
6
C
FIS/01
6
B
ING-INF/05
12
B
ING-INF/05
Un insegnamento a scelta tra i seguenti:
activated in the A.Y. 2013/2014
ModulesCreditsTAFSSD
12
B
INF/01
Un insegnamento a scelta tra i seguenti:
Prova finale
6
E
-

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S000018

Coordinator

Andrea Masini

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

II semestre dal Mar 1, 2012 al Jun 15, 2012.

Learning outcomes

The main objective of this course is the introduction of the fundamental notions of symbolic logic (syntax, semantics, deductive systems) and of discrete mathematics (sets, functions, graphs, trees, structures).

Program

Part 1 (3CFU) Discrete Mathematics

Sets: applications and functions, relations, equivalences, partitions, relation orders, cardinality, finite, denumerable and not denumerable sets, (Cantor's theorem), ordering of the cardinals;
Lattices: the concepts of inf and sup, complete lattices and Boolean lattices, lattices seen as an example of algebraic structures.
Graphs and trees, paths, Eulerian circuits, planar graphs and trees.

Part 2 (3CFU) Logic

Propositional language: propositions and connectives, truth tables, valuations;
Structures: notable examples, monoids, semigroups, natural numbers, graphs;
The language of the first order: Tarski semantics, logical consequence;
Natural Deduction.
Fundamental theorems of natural deduction: soundness (with proof) and completeness (only statement);
First order formalizations of properties.
Algebraic Structures: Sets equipped with an operation (examples: semigroups, monoids, monoids of words, groups, permutations), sets equipped with multiple operations (examples: rings, Boolean algebras). Homomorphisms and isomorphisms of structures.

Reference texts
Author Title Publishing house Year ISBN Notes
Alberto Facchini Algebra e Matematica Discreta (Edizione 1) Edizioni Decibel/Zanichelli 2000 978-8808-09739-2 Studiare: cap 1 (saltando paragrafo 5 e 6) cap 2 (saltando paragrafo 11 ed appendice 14.1)
Andrea Asperti, Agata Ciabattoni Logica a Informatica McGraw-Hill 2007 Srtudiare: Cap 1 (saltando 1.3.6 e 1.3.7) Cap 4 (saltando 4.3.4, 4.3.5 e 4.3.6)
Dirk van Dalen Logic and Structure (Edizione 4) Springer-Verlag 2004 3540208798

Examination Methods

Written exam

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

Teaching materials e documents