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

- Talk: Canonical inner models and their HODs November 28, 2017 Sandra Uhlenbrock
- Quote by Henri Poincaré November 24, 2017 dcernst.github.io
- No representation without taxation. November 22, 2017 Joseph Van Name
- The universal finite set November 22, 2017 Joel David Hamkins
- A POW problem that can incentivize the energy efficient CNOT computer. November 18, 2017 Joseph Van Name

### Comments on Boole’s Rings

- Comment on No representation without taxation. by Joseph Van Name December 3, 2017 Comments for Joseph Van Name
- Comment on A strong form of König’s lemma by saf November 29, 2017 Comments for Assaf Rinot
- Comment on A strong form of König’s lemma by Ari B. November 29, 2017 Comments for Assaf Rinot
- Comment on No representation without taxation. by Jesse C. McKeown November 28, 2017 Comments for Joseph Van Name
- Comment on A forcing axiom deciding the generalized Souslin Hypothesis by saf November 27, 2017 Comments for Assaf Rinot