Valentina Harizanov

Current and Future Courses

Fall, 2009

• Math 271 Introduction to Mathematical Logic
• Check blackboard for class information.
• Math 007 Mathematics and Politics
• Check blackboard for class information.

• Graduate reading and research

Spring, 2009

• Math 32 Single-Variable Calculus II
• Check blackboard for class information.
• Math 102 Axiomatic Set Theory
• Check blackboard for class information.
• Graduate reading and research
  
• Dissertation research

Recent Courses

Fall, 2008

• On sabbatical.

Spring, 2008

• Math 170 Computational Complexity
• Math 195 Undergraduate Reading and Research
• Graduate Reading and Research
• Dissertation research

Fall, 2007

• Math 33 Multivariable Calculus
• Math 272 Graduate Topics in Logic: Algorithms and Mathematics
• Graduate Reading and Research
• Dissertation research

Spring 2007

• Math 801 Dean's Seminar for Freshmen: Turing machines, Chomsky languages, digital and quantum computing
• Math 272 Graduate Topics in Logic: Algorithmic Methods
• Math 195 Undergraduate Reading and Research
• Graduate Reading and Research
• Dissertation research

Fall, 2006

• Math 801 Dean's Seminar for Freshmen: Mathematics of the Infinite
• Math 272 Graduate Topics in Logic: 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