| Number | Class | Instructor | Book(s) | Grade | Description |
| 80-511 | Thesis Seminar | Steve Awodey | A | Presentation of theses by Logic and Computation students | |
| 21-440 | Algebraic Topology | Marc Rieger | Fulton, Algebraic Topology | B | Homotopy, fundamental groups, homology |
| 21-702 | Set Theory II | Ernest Schimmerling | Kunen, Set Theory | Forcing, infinitary combinatorics, descriptive set theory | |
| 21-602 | Set Theory | Ernest Schimmerling | Kunen, Set Theory | A | Independence, descriptive set theory and introduction to forcing. |
| 21-715 | Commutative Algebra | James Cummings | Ajitay and McDonald | B | Commutative ideal theory, localization, Nullstellensatz, exact sequences, tensor products, and Bezout's Theorem. |
| 21-620/21 | Real Analysis/Lebesgue Integration | William Hrusa | Real Analysis, Royden 2nd ed | A / B | Rigorous development of calculus followed by definition and exploration of the Lebesgue integral. |
| 21-651 | General Topology | Juan Jorge Schaeffer | Topology, Kelly | A | Arzela-Ascoli Theorem, Tychonoff's Thm, separation conditions, Urysohn's Lemma, nets, compactification. |
| 80-520 | Categorical Logic | Steve Awodey | A | Seminar class on interpretation of logic in categories, completeness results, coinduction and corecursion. | |
| 21-605 | Teaching Mathematics | Russell Walker | B | Teaching and grading techniques. | |
| 21-603 | Model Theory I | Rami Grossberg | Model Theory, Rami Grossberg's book in progress | A | Elementary extensions, Erdos-Rado Thm, categoricity, types, model completeness and Morley's Thm. |
| 21-701 | Discrete Mathematics | Thomas Bohman | generatingfunctionology, Wilf The Probabalistic Method, Alon and Spencer |
B | Generating functions, the probabalistic method, Lovasz Lemma, Ramsey theory, linear algebraic methods. |
| 21-805 | Lambda Calculus | Richard Statman | Book in progress, Richard Statman | A | Normal forms, decidability in the typed lambda calculus. |
| 80-713 | Category Theory | Steve Awodey | Category Theory, Barr and Wells | A | Basic constructions, natural transformations, Yoneda, adjointness. |
| 21-600 | Mathematical Logic | James Cummings | Course notes, James Cummings | A | Completeness of first order logic, basic model theory. |
| 21-610 | Algebra I | James Cummings | Algebra, Hungerford | C | Sylow Theorems, nilpotence and solvability, free groups, field theory. |
| 80-317 | Constructive Logic | Steve Awodey | Logic in Computer Science, Huth and Ryan Course notes, Frank Pfenning and Steven Awodey |
A | Introduction to constructive logic and constructive type theory, with application to computer science. |
| 80-311 | Computability and Incompleteness | Jeremy Avigad | Computability, Epstein and Carnelli Course Notes, Jeremy Avigad |
A | Computability, undecidability, First and Second Incompleteness theorems. |
| 21-355 | Advanced Calculus I | Michal Kowalczyk | Principles of Mathematical Analysis, Rudin | A | Rigorous development of analysis up to Rieman-Stieljes integral. |
| 21-484 | Graph Theory | Juan Jorge Schaeffer | Graph Theory with applications, Bondy and Murty | A | Trees, connectivity, Euler tours and Hamilton cycles, matchings, graph colorings, planar graphs and Euler's Formula, directed graphs, network flows, counting arguments, and graph algorithms. |
| 21-373 | Algebraic Structures | Thomas Bohman | Abstract Algebra, Dummit and Foote | A | Algebraic systems, groups, rings, fields, integral domains, fields, polynomials, UFD, PID, rings and ideals. |
| 21-301 | Combinatorial Analysis | Richard Statman | Introductory Combinatorics, Bogart | B | Permutations and combinations, generating functions, recurrence relations, inclusion and exclusion, and harmonic series, Catalan numbers. |
| 36-325 | Probability and Mathematical Statistics I | Larry Wasserman | Probability and Statistics, Degroot Course notes, Larry Wasserman |
B | Rigorous introduction to statistics. |
| 80-314 | Logic in AI | Horatio Arlo-Costa | A | Nonmonotonic logic, conditional logic and belief revision methods. | |
| 15-251 | Great Theoretical Ideas in CS | Steven Rudich | Lecture Notes - Professor Rudich | A | Integrate mathematical material with general problem solving techniques and computer science applications. Examples are drawn from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, Cryptography, and Combinatorics. |
| 21-260 | Differential Equations | Marion Bocea | Differential Equations, Edwards | A | ODEs: first and second order equations, applications, Laplace transforms; PDEs: partial derivatives, separation of variables, Fourier series; systems of ODEs; applications. |
| 21-241 | Matrix Algebra | John Tolle | Linear Algebra with Applications, Bretscher | A | Vectors and matrices, the solution of linear systems of equations, vector spaces and subspaces, orthogonality, determinants, real and complex eigenvalues and eigenvectors, linear transformations. |
| 15-212 | Principles of Programming | Michael Erdmann | Introduction To Programming Using SML, Hansen Course Notes, Bob Harper |
A | Formal specifying, constructing, reasoning, and verifying computer programs. |
| 15-211 | Fundamental Data Structures and Algorithms | Peter Lee, William Scherlis | Data Structures and Algorithms in Java, Weiss | A | Fundamental programming concepts with supporting theoretical foundations and practical applications. |