Boole’s Rings- Sigma-Prikry II: Iteration Scheme December 4, 2019 Assaf Rinot
- Logic Colloquium Poznan - TBA November 20, 2019 Sandra Müller
- North American Annual Meeting of the ASL - TBA November 19, 2019 Sandra Müller
- Oberseminar mathematische Logik, Bonn - TBA November 18, 2019 Sandra Müller
- Modern class forcing November 13, 2019 Victoria Gitman
- Comments on Boole’s Rings
- Comment on Knaster and friends I: Closed colorings and precalibers by saf November 2, 2019 Comments for Assaf Rinot
- Comment on A relative of the approachability ideal, diamond and non-saturation by On guessing generalized clubs at the successors of regulars | Assaf Rinot October 24, 2019 Comments for Assaf Rinot
- Comment on Solution to my transfinite epistemic logic puzzle, Cheryl’s Rational Gifts by Cheryl’s Rational Gifts: transfinite epistemic logic puzzle challenge! | Joel David Hamkins October 14, 2019 Comments for Joel David Hamkins
- Comment on The propagation of error in classical geometry constructions by Paul Alberti-Strait October 9, 2019 Comments for Joel David Hamkins
- Comment on The modal logic of arithmetic potentialism and the universal algorithm by The $Sigma_1$-definable universal finite sequence | Joel David Hamkins September 30, 2019 Comments for Joel David Hamkins
Category Archives: Talks
Talk: Survey of mathematically applied computability theory
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
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
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
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
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