Computability and Logic

Undergraduate

A technical exposition of Gödel's first and second incompleteness theorems and of some of their 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. Prerequisite: PHIL 2267 or permission of instructor. QR , HU M 1:30pm-3:25pm