| Course: | LPS 105/205 C; Phil 105/205 C |
| Name: | Undecidability and Incompleteness |
| Description: | This is the continuation of a three quarter course. It will begin
with an introduction to the formal theory of effective processes
(including a discussion of Turing machines and recursive machines),
and then present proofs of the Church undecidability theorem for
first-order logic, Tarski's theorem on the indefinability of
first-order arithmetic truth, and the Gödel incompleteness theorems
concerning formalizations of first-order number theory.
|