In 1931 Kurt Godel proved the famous Incompleteness Theorem, showing that any logical formulation of ordinary arithmetic must contain a statement which can neither be proved nor refuted. This discovery led to questions of solvability, computability, and decidability. In addition to these topics, the course will focus on axiomatics and syntax, the size of sets, semantics, definability, the Completeness Theorem, and many-valued logics. Format: lecture. Evaluation will be based primarily on problem assignments and a final exam. Prerequisites: Mathematics 211 or 251. No enrollment limit (expected: 15).