Accesibility Adjustments

Choose the right accessibility profile for you
OFF ON
Highlight Links Highlights all the links on the site!
OFF ON
Pause Animations Animations will be paused on the site!
OFF ON
Dyslexia Font Dyslexia Font will be applied on the site!
OFF ON
Hide Images All images will be hidden on the site!
Choose the right accessibility profile for you
Adjust Font Sizing
Default
High Saturation
High Contrast
Light Contrast
Dark Contrast
Adjust Letter Spacing
Default
Adjust Line Height
Default
Speak Mode
Align Center
Align Left
Align Right

SIMBOLIČKA LOGIKA


Semester: 5
ECTS: 5
Status: Obavezan
Lessons: 2+2+0
Double: Ne
ECTS catalogue
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
VLADIMIR DREKALOVIĆ2x1
5B+2S
//