Computability and Logic

Graduate / Professional

A technical exposition of Gödel’s first and second incompleteness theorems and of some of their main consequences in proof theory and model theory, such as Löb’s theorem, Tarski’s undefinability of truth, provability logic, and nonstandard models of arithmetic. M 1:30pm-3:25pm