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

- Towards a general method for accessible content trees or: deep aria-labels for equations revisited January 13, 2019 Peter Krautzberger
- Forcing as a computational process, Cambridge, Februrary 2019 January 5, 2019 Joel David Hamkins
- Foundations of analysis January 1, 2019 Samuel Coskey
- Matrices for classical groups January 1, 2019 Nick Gill
- Logic and set theory January 1, 2019 Samuel Coskey

### Comments on Boole’s Rings

- Comment on The subseries number by The rearrangement and subseries numbers: how much convergence suffices for absolute convergence? Mathematics Colloquium, University of Münster, January 2019 | Joel David Hamkins January 10, 2019 Comments for Joel David Hamkins
- Comment on Souslin trees at successors of regular cardinals by saf December 19, 2018 Comments for Assaf Rinot
- Comment on A new proof of the Barwise extension theorem, without infinitary logic, CUNY Logic Workshop, December 2018 by Joel David Hamkins December 16, 2018 Comments for Joel David Hamkins
- Comment on A new proof of the Barwise extension theorem, without infinitary logic, CUNY Logic Workshop, December 2018 by Joel David Hamkins December 15, 2018 Comments for Joel David Hamkins
- Comment on A new proof of the Barwise extension theorem, without infinitary logic, CUNY Logic Workshop, December 2018 by Athar December 15, 2018 Comments for Joel David Hamkins