PHIL470

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 2026

Eric Pacuit

1 review
Average rating: 5.00

Past Semesters

Eric Pacuit

1 review
Average rating: 5.00

Eric Pacuit

1 review
Average rating: 5.00

Include P/F semesters During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.

Average GPA of 3.50 between 63 students*

A-: 19.05%

A: 44.44%

A+: 4.76%

B: 12.7%

B+: 3.17%

C: 3.17%

W: 4.76%

other: 7.94%

* "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.