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

- Faculty respondent to paper of Ethan Jerzak on Paradoxical Desires, Oxford Graduate Philosophy Conference, November 2018 November 9, 2018 Joel David Hamkins
- (with J. Aguilera) The consistency strength of long projective determinacy November 6, 2018 Sandra Müller
- The Axiom of Determinacy implies Dependent Choices in mice November 5, 2018 Sandra Müller
- 6 Thoughts on accessibility of equation layout October 28, 2018 Peter Krautzberger
- Cohen's Oddity October 20, 2018 Asaf Karagila

### Comments on Boole’s Rings

- Comment on Lectures on the Philosophy of Mathematics, Oxford, Michaelmas 2018 by Joel David Hamkins November 9, 2018 Comments for Joel David Hamkins
- Comment on Lectures on the Philosophy of Mathematics, Oxford, Michaelmas 2018 by Artem Kaznatcheev November 8, 2018 Comments for Joel David Hamkins
- Comment on Alan Turing, On computable numbers by Joel David Hamkins October 13, 2018 Comments for Joel David Hamkins
- Comment on Alan Turing, On computable numbers by Lorenzo Cocco October 13, 2018 Comments for Joel David Hamkins
- Comment on Alan Turing, On computable numbers by Joel David Hamkins October 13, 2018 Comments for Joel David Hamkins