| Course: | SS 105C/205C, Phil 105C/205C |
| Name: | Effective Processes |
| 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.
Students wishing a grade will be asked to submit weekly problem sets (one quarter of grade), take an in-class midterm examination (one quarter of grade), and take an in-class final examination (one half of grade). For further information, see the Course Webpage.
|