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 to present some more recent applications to mathematics, via Reverse Mathematics and via Weihrauch Reducibility.

### Boole’s Rings

- Modern class forcing November 13, 2019 Victoria Gitman
- Knaster and friends II: The C-sequence number October 23, 2019 Assaf Rinot
- (with Y. Hayut) Perfect Subtree Property for Weakly Compact Cardinals October 11, 2019 Sandra Müller
- On conjugacy problems for graphs and trees October 11, 2019 Samuel Coskey
- Ground model definability in ${\rm ZF}$ October 10, 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 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
- Comment on I know that you know that I know that you know…. Oxford, October 2019 by Joel David Hamkins September 25, 2019 Comments for Joel David Hamkins