UMD PHIL 470 Entire Class
University of Maryland PHIL 470 Logical Theory II Incompleteness and Undecidability Entire Class
Introduces the formal theory of computation, and then presents 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.
Note: This entire class includes discussions, assignments, course projects, and exams.