MATH 592 - Mathematical Logic 2. |
Introduction to recursion theory; recursively enumerable sets, relative recursiveness. Incompleteness, undecidability and undefinability theorems of Gödel, Church, Rosser and Tarski. Some of the following topics: Turing degrees, Friedberg-Muchnik theorem, decidable and undecidable theories.
Taught in alternate years Winter Prerequisites: MATH 488 or equivalent or consent of instructor 4.000 Credit hours Schedule Types: Lecture, Final Exam Faculty of Science Mathematics and Statistics Department Restrictions: May not be enrolled in one of the following Faculties: Fac Dental Medicine & Oral HS Faculty of Medicine & Hlth Sci School of Continuing Studies |
Return to Previous | New Search |
![]() |