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.
The Study plan 2008/2009 will be available by May 2nd. While waiting for it to be published, consult the Study plan for the current academic year at the following link.
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 for computer science (2009/2010)
Teaching code
4S02848
Teacher
Coordinator
Credits
6
Also offered in courses:
- Logic of the course Bachelor in Computer Science (until 2008-2009 academic year)
Language
Italian
Scientific Disciplinary Sector (SSD)
MAT/01 - MATHEMATICAL LOGIC
Period
1st Semester dal Oct 1, 2009 al Jan 31, 2010.
Learning outcomes
The mere existence of computer science depends on the capability of representing notions adequately and processing them through appropriate transformations of their representations. In other words, the elaboration of knowledge is based on the distinctions and relationship between semantics and syntax.
The main objective of this course is thus the introduction of the fundamental notions of symbolic logic: syntax, semantics, language and metalanguage, deductive systems, structure and representability.
Program
Propositional logic: Syntax and semantics; deductive systems (introduce at least one of the following systems: natural deduction, sequent calculus, tableaux); soundness and completeness; functional completeness.
Predicate logic: Quantifiers; structures and semantics of first-order logic; equality; extensions of the deductive systems for quantifiers and equality; first-order mathematical theories; theorems of soundness and completeness; compactness theorem and Loewenheim-Skolem theorem; formalization of mathematical structures and representability; Peano arithmetics; statement of the incompleteness theorem.
Examination Methods
The examination consists of a written test that must be taken without the help of notes, books, or other documentation. The teacher may decide to replace the written test with an oral examination.
