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
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
Modules | Credits | TAF | SSD |
---|
2° Year activated in the A.Y. 2011/2012
Modules | Credits | TAF | SSD |
---|
3° Year activated in the A.Y. 2012/2013
Modules | Credits | TAF | SSD |
---|
Un insegnamento a scelta tra i seguenti:
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Un insegnamento a scelta tra i seguenti:
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.
Logics and discrete mathematics (2010/2011)
Teaching code
4S000018
Teacher
Coordinator
Credits
6
Also offered in courses:
- Logic for computer science of the course Bachelor's degree in Computer Science
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
II semestre dal Mar 1, 2011 al Jun 15, 2011.
Learning outcomes
Introduction to fundamental notions of symbolic logic (syntax, semantics, language and meta-language, deductive system, structures and representations) and of constitutive and enumerative principles of fundamentals discrete structures (sets, multisets, sequences, trees, graphs, structural induction and enumeration methods).
Program
Sets and operations. Compositions, iterations, closures, and extensions of operations. Discreteness, incommensurability, continuity, and approximation. Measures and number notations. Mathematical induction. Trees, graphs, variables, and expressions. Patterns, tags and mark-up notations. Finite structures and hyper-structures. Structural induction. Allocations, combinations, and partitions. Factorials and binomials. Numbers of Stirling, Catalan, and Bell. Recurrent relations and enumerations of fundamental finite structures. Stirling approximation.
Propositions and propositional compactness. Predicate logic: quantifiers, syntax and semantics of first-order logic. Examples of first order theories. Deductive systems (introduction at least of one of the following systems: natural deduction, sequent calculus, tableaux). Theorems of soundness, compactness and Loewenheim-Skolem theorem. First order formalization within mathematical structures. Peano arithmetics. Statement of the incompleteness theorem.
Examination Methods
Periodic assignments. Midterm and final written exams.