everything.study
MATH-UA 231

Computability and Incompleteness

(4 Credits)

Identical to PHIL-UA 75 . An introduction to the theory of computability and to the major limitative results of mathematical logic, including the undecidability of first-order logic, Gödel's incompleteness theorems, and Tarski's theorem on the non-definability of truth.

Sources