Mathematical Logic

4.0 credits

This is a course on metalogic and computability, building up to Godel's incompleteness theorems. The course explores what is and is not possible when it comes to formalizing arithmetic in standard first-order logic. It introduces concepts of proof, satisfaction, decidability, primitive recursion, computability, and others.