Natural and Health Sciences
- 2009, Ph.D. (Mathematics), University of Connecticut.
- 2006, M.A. (Mathematics), University of Connecticut.
- 2004, B.A. (Philosophy), University of Northern Colorado.
- 2004, B.S. (Mathematics), University of Northern Colorado.
- 2011-present: Assistant Professor, University of Northern Colorado.
- 2009-2011: Visiting Assistant Professor, Coastal Carolina University.
- 2005-2009: Graduate Teaching Assistant, University of Connecticut.
Research/Areas of Interest
Courses I regularly teach include Discrete Mathematics (MATH 228), and Abstract Algebra
I & II (MATH 321 & 322). I have also taught courses on Calculus, Modern Geometry,
Continuous Mathematics, and graduate courses in Logic and Graph Theory. More information
about my teaching activities can be found on my personal website.
I work in an area of mathematical logic known as computability theory (or sometimes as recursion theory). The goal is to understand to what extent "regular" mathematics is or is not algorithmic.
I am especially interested in applications to algebra and combinatorics.
I have also collaborated with a number of undergraduate students on research projects
both in and out of computability theory.
- Levin, O., McMillan, T., Computing Planarity in Computable Planar Graphs, submitted for publication.
- Levin, O. Computable Dimension for Ordered Fields, to appear in Archive for Mathematical Logic.
- Jura, M., Levin, O., Markkanen, T. A-Computable Graphs. Annals of Pure and Applied Logic 167:3 (2016) 235-246.
- Jura, M., Levin, O., Markkanen, T. Domatic Partitions of Computable Graphs, Archive for Mathematical Logic, 53:1 (January 2014) 137-155.
- Levin, O., Roberts, G. Counting Knights and Knaves, College Mathematics Journal, 44:4 (September 2013) 300-306.
- Kach, A.M., Levin, O., Solomon, D.R., Embeddings of Computable Structures, Notre Dame Journal of Formal Logic, 51:1 (May 2010) 55-68.
See my research page for copies of these papers.