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

- Virtual Vopěnka’s Principle July 15, 2018 Victoria Gitman
- Open class determinacy is preserved by forcing July 2, 2018 Joel David Hamkins
- 11th Young Set Theory Workshop, June 2018 June 30, 2018 Assaf Rinot
- IMO resources for Graph Theory June 24, 2018 Mike Pawliuk – Mathematics
- Paul K. Gorbow, PhD 2018, University of Gothenburg June 16, 2018 Joel David Hamkins

### Comments on Boole’s Rings

- Comment on How tall is the automorphism tower of a group? by jvanname July 10, 2018 Comments for Joel David Hamkins
- Comment on The exact strength of the class forcing theorem by Open class determinacy is preserved by forcing | Joel David Hamkins July 2, 2018 Comments for Joel David Hamkins
- Comment on Open determinacy for class games by Open class determinacy is preserved by forcing | Joel David Hamkins July 2, 2018 Comments for Joel David Hamkins
- Comment on Infinite Sudoku and the Sudoku game by Nik Weaver June 24, 2018 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Thomas Benjamin June 12, 2018 Comments for Joel David Hamkins