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

- Cohen's Oddity October 20, 2018 Asaf Karagila
- The Stable Core October 15, 2018 Victoria Gitman
- On splitting families October 12, 2018 Samuel Coskey
- MSc thesis on matrix completion October 5, 2018 Nick Gill
- Souslin trees at successors of regular cardinals October 1, 2018 Assaf Rinot

### Comments on Boole’s Rings

- 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
- Comment on Alan Turing, On computable numbers by Sam Butchart October 13, 2018 Comments for Joel David Hamkins
- Comment on Alan Turing, On computable numbers by Joel David Hamkins October 9, 2018 Comments for Joel David Hamkins