This is a problem oriented course in mathematical logic and computability for students with some degree of mathematical sophistication. The course is divided into the following five major topics: Basics of Proposition Logic, Basics of first-order logic (Predicate Calculus), Computability using Turing machines and recursive functions, Incompleteness, Computable and Incomputable functions.