MATHEMATICAL LOGIC

Course objectives

General aims: to acquire basic knowledge and skills in mathematical logic and to be able to apply them in various contexts, including teaching. Specific aims: Knowledge and understanding: The successful student will have acquired basic notions and results in mathematical logic: propositional calculus, predicates calculus, Peano arithmetic and incompleteness results. Applying knowledge and understanding: The successful student will be able to solve exercises and problems of mathematical logic; exercises and problems refer to the topics covered, to other mathematical areas, to teaching and learning mathematics, to natural language. S/he will recognize various kinds of formulas in the simplest cases (tautologies, valid formulas, ...). S/he will be able to recognize and apply inference rules. Critical and judgmental skills: The successful student will be familiar with mathematical rigor and formalism. S/he will have reflected on known mathematical contents and on the translation of concepts in axiomatic theories with appropriate languages. S/he will be able to discuss the role of intuition and rigor in teaching mathematics in different situations. Communication skills: The successful student will be able to present subjects and arguments in the oral test, and to explain what s/he learned. Learning skills: The acquired knowledge will allow to study more specialized subjects. The student will be motivated to extend the acquired knowledge.

Channel 1
LORENZO CARLUCCI Lecturers' profile

Program - Frequency - Exams

Course program
Propositional Logic: language, formulas, assignments, truth tables, logical truth and logical consequence, Compactness Theorem, formal deduction systems (propositional calculus), Completeness Theorem, concepts of algorithmic decidability and enumerability. Predicate Logic: language, formulas, structures, satisfaction, truth in a model, logical truth and logical consequence, isomorphism and elementary equivalence between structures, quantifier elimination, completeness and decidability of theories, formal deduction systems (predicate calculus), Deduction Theorem, Completeness Theorem, Compactness Theorem, applications of Compactness to mathematical theorems, non-standard models of Number Theory, ultrafilters and ultrapowers, Peano Arithmetic, Computable Functions, Representability Theorem, Gödel's Incompleteness Theorems, Tarski's Theorem on Arithmetical Truth, concrete examples of independence from Peano Arithmetic.
Prerequisites
No prerequisite
Books
Handouts by the teacher.
Frequency
Attendance is not mandatory but is warmly encouraged. Non-attending students are invited to get in touch with the instructor before the beginning of the course.
Exam mode
Final written exam, oral exam for those who pass the written exam
Bibliography
1. Introduction to Mathematical Logic, Elliot Mendelson (https://www.karlin.mff.cuni.cz/~krajicek/mendelson.pdf) 2. A concise introduction to Mathematical Logic, W. Rautenberg (Springer 2006) 3. Logic and Structure, D. van Dalen (Springer 1994) 4. Logical Foundations of Mathematics and Computational Complexity. A Gentle Introduction, P. Pudlak (Springer 2013).
Lesson mode
The teaching style is oriented to dialogue and student interaction and participation. Attention is given to the analysis and discussion of concrete examples for fleshing out the abstract definitions and to exercises discussed in class in a collaborative mode.
  • Lesson code1022365
  • Academic year2024/2025
  • CourseMathematics
  • CurriculumStoria, didattica e fondamenti
  • Year3rd year
  • Semester1st semester
  • SSDMAT/01
  • CFU6
  • Subject areaFormazione Teorica