LM410 - MATHEMATICAL LOGIC 1
(objectives)
Application of the compactness theorem, Löwenheim-Skolem’s theorem. Basic recursion theory, decidability. Completeness and decidability of a first order theory, examples. Peano’s arithmetic and Gödel’s incompleteness theorems.
|
Code
|
20402119 |
Language
|
ITA |
Type of certificate
|
Profit certificate
|
Credits
|
7
|
Scientific Disciplinary Sector Code
|
MAT/01
|
Contact Hours
|
60
|
Type of Activity
|
Elective activities
|
Derived from
|
20710114 LOGICA, COMPUTAZIONE, COGNIZIONE in Cognitive Sciences of Communication and Action LM-92 ABRUSCI VITO MICHELE
(syllabus)
• PROVABILITY AND SATISFIABILITY, TRANSFORMATION (REDUCTION) OF PROOFS • COMPACTNESS THEOREM FOR FIRST-ORDER LOGIC • COMPLETENESS THEOREM FOR FIRST-ORDER LOGIC • CUT-ELIMINATION THEOREM FOR FIRST-ORDER LOGIC
(reference books)
V. Michele Abrusci, Lorenzo Tortora de Falco: LOGICA Volume 1 Dimostrazioni e modelli al primo ordine. Springer, 2014
|
Dates of beginning and end of teaching activities
|
From 01/10/2015 to 20/12/2015 |
Delivery mode
|
Traditional
|
Attendance
|
not mandatory
|
Evaluation methods
|
Oral exam
|
Derived from
|
20710114 LOGICA, COMPUTAZIONE, COGNIZIONE in Cognitive Sciences of Communication and Action LM-92 ABRUSCI VITO MICHELE
(syllabus)
• PROVABILITY AND SATISFIABILITY, TRANSFORMATION (REDUCTION) OF PROOFS • COMPACTNESS THEOREM FOR FIRST-ORDER LOGIC • COMPLETENESS THEOREM FOR FIRST-ORDER LOGIC • CUT-ELIMINATION THEOREM FOR FIRST-ORDER LOGIC
(reference books)
V. Michele Abrusci, Lorenzo Tortora de Falco: LOGICA Volume 1 Dimostrazioni e modelli al primo ordine. Springer, 2014
|
Dates of beginning and end of teaching activities
|
From 01/10/2015 to 20/12/2015 |
Delivery mode
|
Traditional
|
Attendance
|
not mandatory
|
Evaluation methods
|
Oral exam
|
|
|