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

- Quote by Yoda in The Last Jedi February 17, 2018 dcernst.github.io
- Hyperbinary numbers and fraction trees February 6, 2018 Samuel Coskey
- Modal principles of potentialism, Oxford, January 2018 February 1, 2018 Joel David Hamkins
- Written elsewhere, booknet canada edition: Equations ≠ Math January 30, 2018 Peter Krautzberger
- The subseries number January 23, 2018 Joel David Hamkins

### Comments on Boole’s Rings

- Comment on The emerging zoo of second-order set theories by Victoria Gitman February 16, 2018 Comments for Victoria Gitman
- Comment on The emerging zoo of second-order set theories by Joel David Hamkins February 15, 2018 Comments for Victoria Gitman
- Comment on Prikry forcing may add a Souslin tree by saf February 14, 2018 Comments for Assaf Rinot
- Comment on Prikry forcing may add a Souslin tree by Mohammad February 14, 2018 Comments for Assaf Rinot
- Comment on Math for eight-year-olds: graph theory for kids! by Revisiting Joel David Hamkins’s “Graph Theory for Kids” | Mike's Math Page February 11, 2018 Comments for Joel David Hamkins