Logical Theory II: Incompleteness and Undecidability

Prerequisite: PHIL370; or permission of instructor. Introduces the formal theory of computation, and then presents the the central limitative results of modern first-order logic: Church's undecidability theorem and Godel's first and second incompleteness theorems. The primary focus of the course is a thorough technical study of these fundamental results, but we will also discuss some of the philosophical issues they raise. Further topics may include second-order logic.

Spring 2022

7 reviews
Average rating: 4.57

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.