Current Courses

Spring 2012

  • Math 2971W Introduction to Mathematical Reasoning
  • Undergraduate Reading and Research
  • Graduate Reading and Research
  • Dissertation Research

Fall 2011

Recent Courses

Spring 2011

  • Math 3730 (with WID option) Computability Theory
  • Math 272 Graduate Topics in Logic: Computable Structure Theory
  • Graduate Reading and Research
  • Dissertation Research

Fall 2010

  • Math 7 Mathematics and Politics
  • Math 272 Graduate Topics in Logic: Topics in Computation Theory
  • Graduate Reading and Research

Spring 2010

  • Math 104 and 104W Computational Complexity
  • Math 52 Calculus for the Social and Management Sciences
  • Graduate Reading and Research

Fall 2009

  • Math 271 Mathematical Logic
  • Math 7 Mathematics and Politics
  • Graduate Reading and Research

Spring 2009

  • Math 32 Single-Variable Calculus II
  • Math 102 Axiomatic Set Theory
  • Graduate Reading and Research
  • Dissertation Research

Other courses taught at GW

  • Introductory Undergraduate: College algebra; General mathematics; Mathematical ideas; Precalculus; Calculus with precalculus; Calculus for the social and management sciences; Finite mathematics for the social and management sciences; Single variable calculus I; Single variable calculus II; Multivariable calculus.
  • Advanced Undegraduate: Introduction to mathematical logic; Introduction to automata theory (Statistics Department); Axiomatic set theory; Computability theory (including writing in the disciplines version); Computational complexity.
  • Graduate
    • Mathematical logic
    • Graduate Topics in Logic
      • Incompleteness of formal systems. Turing degrees
      • NP-completeness. Multi-valued logic
      • Effective model theory
      • Independence results in set theory
      • Recursion theory: hierarchies, oracles and degrees
      • Models, algorithms, and applications
      • The forcing method
      • Computable model theory
      • Frequency computations. Computable algebra
      • Algorithmic learning. Gödel incompleteness
      • Computability theory and applications to structures
      • Ordinals, definability, and computability
      • Model theory and algorithmic model theory
      • Set theory
      • Algorithmic methods
      • Algorithms and mathematics
    • Special Courses: Mathematical theory of languages, I–II for the University Honors Program; Set theory for the Summer Program for Women in Mathematics; Dean's Seminar for Freshmen: Mathematical logic, language, and learning; Dean's Seminar for Freshmen: Is reasoning computable?; Dean's Seminar for Freshmen: Mathematics of the infinite; Dean's Seminar for Freshmen: Turing machines, Chomsky languages, digital and quantum computing; Computational complexity for the Computational Sciences Master's Program