logo-polimi
Loading...
Degree programme
Programme Structure
Show/Search Programme
Course Details
Save Document
Degree Programme
Degree Programme not available
Faculty
Infrastructures
Quantitative data
International context
Customized Schedule
Your customized time schedule has been disabled
Enable
Search
Search a Professor
Search a Course
Search a Course (system prior D.M. n. 509)
Search Lessons taught in English

Glossary
Semester (Sem)
1First Semester
2Second Semester
AAnnual course
Educational activities
CSimilar or integrative activities
Language
Course completely offered in italian
Course completely offered in english
--Not available
Innovative teaching
The credits shown next to this symbol indicate the part of the course CFUs provided with Innovative teaching.
These CFUs include:
  • Subject taught jointly with companies or organizations
  • Blended Learning & Flipped Classroom
  • Massive Open Online Courses (MOOC)
  • Soft Skills
Course Details
Context
Academic Year 2014/2015
School School of Industrial and Information Engineering
Name (Master of Science degree)(ord. 270) - MI (434) Engineering of Computing Systems
Track T2A - Sistemi e applicazioni dell'Informatica
Programme Year 2

Course Details
ID Code 091021
Course Title LOGIC AND ALGEBRA 2
Course Type Mono-Disciplinary Course
Credits (CFU / ECTS) 5.0
Semester First Semester
Course Description The aim of the course is to present some logics of particular interest for Information Engineering, with particular attention to issues of decidability and application aspects, as well as the discussion of some of the mathematical foundations of cryptography, i.e., the theory of finite fields. In the first part, we will prove results of correctness, completeness and decidability for a wide class of modal logics, temporal logics (CTL, CTL* and LTL) and descriptive logics. Also decision algorithms for these logics (semantic tableaux and automata based algorithms) will be discussed. The second part will present the main results concerning finite fields and a factoring algorithm for polynomials on a field (Berlekamp algorithm). Finally, some cryptographic applications (digital signature and LFSR) will be discussed.
Scientific-Disciplinary Sector (SSD)
Educational activities SSD Code SSD Description CFU
C
MAT/01
MATHEMATICAL LOGIC
5.0

Schedule, add and removeAlphabetical groupProfessorLanguageCourse details
From (included)To (excluded)
--AZZZZCherubini Alessandra
manifesti v. 3.1.9 / 3.1.9
Area Servizi ICT
09/12/2019