 
Mathematical Logic and Computability 
Abbreviation:  Load: 45(L)
+ 0(E)
+ 0(LE)
+ 0(CE)

Lecturers in charge:  Doc. dr. sc. Mladen Vuković 
Lecturers:  
Course description: The course is divided into three parts. In the first part we consider propositional logic. The main aim of the first part is to emphasize the difference between syntax and semantics. The first part is a motivation and introduction for the second part in that we study firstorder logic. Specially considered ia the undecidabilty of firstorder logic, and a necessity of a formal definition of algorithm is emphasized. In the third part we study theory of computation. RAMmachines are considered as a basic model of computation. Then we define the class of partial recursive function, and prove that the class of partial recursive functions is equal to the class of RAMcomputable functions. It is a motivation for Church thesis. 
Compulsory literature: 
1.  Matematička logika;M. Vuković;Profil;2009 
2.  Izračunljivost; M.Vuković;webizdanje;2007 
Recommended literature: 
3.  Mathematical Logic;R. Cori, D. Lascar;Oxford Un. Press;2000 
4.  Introduction to the Theory of Computation;M. Sipser;PWS Pub. Company;1997. 
 