Go to Main Content

Minerva

 

HELP | EXIT

Detailed Course Catalog Information

 

Fall 2017
Nov 20, 2017
Transparent Image
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:     
      Faculty of Dentistry
      Faculty of Medicine
      School of Continuing Studies

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4