Tyler Markkanen
  • Doctor of Philosophy, University of Connecticut, Storrs, Conn., 2009
  • Master of Science, University of Connecticut, Storrs, Conn., 2006
  • Bachelor of Science, Rensselaer Polytechnic Institute, Troy, N.Y., 2004

Tyler Markkanen is a mathematician and teacher. His research is in mathematical logic, with a special interest in computability theory and computable model theory. For fun, he likes to sing, perform magic tricks, and play games. After graduate school, Markkanen taught as a tenure-track assistant professor of mathematics at Saint Mary-of-the-Woods College in Terre Haute, Ind. From the fall of 2011 to the spring of 2014, he was a visiting assistant professor of mathematics at Manhattan College in Riverdale, N.Y. He began his work at Springfield College in fall 2014, and says he is loving every minute of it!

Research Interests

  • Mathematical Logic
  • Computability Theory
  • Computable Model Theory

Courses Taught

  • Foundations of Mathematics
  • Precalculus Mathematics
  • Introduction to Calculus with Applications
  • Geometry
  • Discrete Mathematics I
  • Discrete Mathematics II
  • Linear Algebra

Certifications and Memberships

  • Teaching Certification for Mathematics, Grades 7-12 in Connecticut
  • American Mathematical Society
  • Mathematical Association of America
  • UConn Logic Group

Selected Works


  • Mathematics, Physics, and Computer Science Colloquium - Springfield College, Springfield, MA (November 2015). "There are two errors in the the title of this talk."
  • New England Recursion and Definability Seminar (NERDS), Assumption College, Worcester, MA (October 2015). "A-computable graphs."
  • Mathematics Department Colloquium - Central Connecticut State University, New Britain, CT (February 2015). "Can computers do math? An introduction to computability theory and effective mathematics."
  • Joint Mathematics Meetings, San Diego, TX (January 2015). Event: AMS Session on Mathematical Logic. "Restricting the Turing degree spectra of structures."
  • CUNY Logic Workshop, CUNY Graduate Center, New York, NY (May 2014). “The domatic numbers of computable graphs.”
  • Joint Mathematics Meetings, Baltimore, MD (January 2014). Event: AMS Session on Logic and Probability. "Highly computable graphs and their domatic numbers."
  • Joint Mathematics Meetings, San Diego, CA (January 2013). Event: ASL Contributed Paper Session. "Domatic partitions of computable graphs."
  • NERDS, Wellesley College, Wellesley, MA (October 2012). "Domatic partitions of computable graphs."
  • Manhattan College Math and CS Seminar, Riverdale, NY (September 2012). "The shortest math talk that cannot be titled in under thirteen words."
  • Indiana University Logic Seminar, Bloomington, IN (April 2011). "Separating the Turing degree spectra of countable structures."


  • "A-Computable graphs" (with Matthew Jura and Oscar Levin). Ann. Pure Appl. Logic, 2016, Volume 167, no. 3, Pages 235-246, DOI 10.1016/j.apal.2015.11.003, URL http://dx.doi.org/10.1016/j.apal.2015.11.003.
  • "Finding domatic partitions in infinite regular graphs" (with Matthew Jura and Oscar Levin). Electronic Journal of Combinatorics, 2015, Volume 22, Issue 3, Paper #P3.39. The final publication is available at http://www.combinatorics.org/ojs/index.php/eljc/article/view/5089.
  • "Domatic partitions of computable graphs" (with Matthew Jura and Oscar Levin). Archive for Mathematical Logic, 2014, Volume 53, Pages 137-155, DOI 10.1007/s00153-013-0359-2. The final publication is available at link.springer.com.
  • "Separating the degree spectra of structures." Ph.D. dissertation, University of Connecticut, 2009.