A Problem Course in Mathematical Logic. Version 1.6

This book is a free text intended to be the basis for a problem-oriented course(s) in mathematical logic and computability for students with some degree of mathematical sophistication. Parts I and II cover the basics of propositional and rst-order logic respectively, Part III covers the basics of computability using Turing machines and recursive functions, and Part IV covers G¨ odel’s Incompleteness Theorems. They can be used in various ways for courses of various lengths and mixes of material. The author typically uses Parts I and II for a one-term course on mathematical logic, Part III for a one-term course on computability, and/or much of Part III together with Part IV for a one-term course on computability and incompleteness.