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

- Zoom into the classical Laver table fractals February 26, 2017 Joseph Van Name
- Open and clopen determinacy for proper class games, VCU MAMLS April 2017 February 25, 2017 Joel David Hamkins
- Computable quotient presentations of models of arithmetic and set theory, CUNY set theory seminar, March 2017 February 25, 2017 Joel David Hamkins
- Got jobs? February 19, 2017 Asaf Karagila
- 2017 Workshop in Set Theory, Oberwolfach February 19, 2017 Assaf Rinot

### Comments on Boole’s Rings

- Comment on Reflection on the coloring and chromatic numbers by saf February 26, 2017 Comments for Assaf Rinot
- Comment on Open determinacy for class games by Open and clopen determinacy for proper class games, VCU MAMLS April 2017 | Joel David Hamkins February 25, 2017 Comments for Joel David Hamkins
- Comment on All triangles are isosceles by Joel David Hamkins February 14, 2017 Comments for Joel David Hamkins
- Comment on All triangles are isosceles by Daniel Nagase February 13, 2017 Comments for Joel David Hamkins
- Comment on All triangles are isosceles by Robert Lewis February 12, 2017 Comments for Joel David Hamkins