Category Archives: Talks

Talk: Survey of mathematically applied computability theory

Posted on November 19, 2016 by Carl Mummert

Despite being relatively small, my department has three faculty in finite combinatorics, in addition to having me in logic. I recently gave a series of two talks in our seminar to present a broad overview of classical computability theory, and … Continue reading →

Posted in Talks | Leave a comment

Talk on Reverse Mathematics and Ramsey Theory

Posted on March 18, 2016 by Carl Mummert

This is a copy of my notes from a two-hour talk I gave at our local combinatorics seminar about Reverse Mathematics and Ramsey Theory. The audience consisted of our combinatorialists, who are not logicians, and so the talk is intended … Continue reading →

Posted in Talks, Uncategorized | Leave a comment

Talk on the existence of connected components of graphs

Posted on September 23, 2015 by Carl Mummert

This week I am attending a seminar at Dagstuhl on Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis. This post has slides from my talk and some blog-only remarks to expand on them.

Posted in Research, Talks | Leave a comment

Talk on Reverse Mathematics and the Modal Logic of Reverse Mathematics

Posted on November 25, 2013 by Carl Mummert

This is a transcription of notes from a talk I gave on November 1, 2013 to the interdisciplinary logic seminar at the University of Connecticut. I gave a general introduction to Reverse Mathematics and then spoke about my work with … Continue reading →

Posted in Research, Talks | 3 Comments

Internal combinatorics and uniform reducibility

Posted on December 5, 2012 by Carl Mummert

This post is a set of notes from a talk I gave on December 5th for the discrete mathematics seminar at Marshall University. I want to argue that logical analysis can reveal the “internal combinatorics” of theorems, using some recent … Continue reading →

Posted in Musings, Research, Talks | Leave a comment