SIMBOLIČKA LOGIKA
Semester: 5
ECTS: 5
Status: Obavezan
Lessons: 2+2+0
Double: Ne
ECTS catalogue
Learning outcomes:
Learning outcomes:
After the student passes this exam, he will be able to: 1. Formulate Pean arithmetic in predicate logic. 2. Explain the basic concepts of computability theory and recognize the possibility and importance of encoding syntax objects in natural numbers. 3. Describe the completeness of the theory in predicate logic. 4. Formulates and explains the meaning of Gödels incompleteness theorems. 5. Explains the most important philosophical consequences of Gödels theorems.
Teaching staff
| Name | Lectures | Exercises | Laboratory |
|---|---|---|---|
| DARKO BLAGOJEVIĆ | 2x1 10B | ||
| VLADIMIR DREKALOVIĆ | 2x1 10B |
