MATH5165: Mathematical Logic I

4 Credits

Theory of computability: notion of algorithm, Turing machines, primitive recursive functions, recursive functions, Kleene normal form, recursion theorem. Propositional logic. prereq: 2283 or 3283 or Phil 5201 or CSci course in theory of algorithms or instr consent

View on University Catalog

All Instructors

A- Average (3.649)Most Common: A (65%)

This total also includes data from semesters with unknown instructors.

229 students
WFDCBA
  • 3.51

    /5

    Recommend
  • 4.46

    /5

    Effort
  • 3.83

    /5

    Understanding
  • 3.26

    /5

    Interesting
  • 3.73

    /5

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2024 provided by the Office of Institutional Data and Research

      Privacy Policy