### Boole’s Rings

- Inclusion modulo nonstationary June 20, 2019 Assaf Rinot
- Tuna Altinel June 6, 2019 Nick Gill
- Completely ineffable cardinals June 5, 2019 Victoria Gitman
- Some cute observations about computably saturated models June 4, 2019 Victoria Gitman
- Alan Turingâ€™s theory of computation, Oxford and Cambridge Club, June 2019 June 2, 2019 Joel David Hamkins

### Comments on Boole’s Rings

- Comment on How to count by Joel David Hamkins May 30, 2019 Comments for Joel David Hamkins
- Comment on How to count by A witness to the writhing void May 29, 2019 Comments for Joel David Hamkins
- Comment on 50 Years of Set Theory in Toronto, May 2019 by saf May 26, 2019 Comments for Assaf Rinot
- Comment on The multiverse view in set theory, Singapore 2011 by A multiverse perspective on the axiom of constructiblity | Joel David Hamkins May 20, 2019 Comments for Joel David Hamkins
- Comment on Modal principles of potentialism, Oxford, January 2018 by David Roberts May 12, 2019 Comments for Joel David Hamkins

# Category Archives: Research

## Reverse Mathematics of Matroids

This post is about the paper Reverse Mathematics of Matroids by Jeff Hirst and me. We look at basis theorems for countable vector spaces, countable graphs, and countable enumerated matroids. These three kinds of structures turn out to be extremely … Continue reading

Posted in Papers, Research
Leave a comment

## Talk on the existence of connected components of graphs

This week I am attending a seminar at Dagstuhl on Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis. This post has slides from my talk and some blog-only remarks to expand on them.

Posted in Research, Talks
Leave a comment

## Talk on Reverse Mathematics and the Modal Logic of Reverse Mathematics

This is a transcription of notes from a talk I gave on November 1, 2013 to the interdisciplinary logic seminar at the University of Connecticut. I gave a general introduction to Reverse Mathematics and then spoke about my work with … Continue reading

Posted in Research, Talks
3 Comments

## Internal combinatorics and uniform reducibility

This post is a set of notes from a talk I gave on December 5th for the discrete mathematics seminar at Marshall University. I want to argue that logical analysis can reveal the “internal combinatorics” of theorems, using some recent … Continue reading

Posted in Musings, Research, Talks
Leave a comment

## An incompleteness theorem for β_{n} models

My first paper was “An incompleteness theorem for $\beta_n$ models” with Stephen Simpson [1]. It’s a short paper, but the idea is very pretty. We know that the incompleteness theorem implies there are strange models of arithmetic, but these models … Continue reading

Posted in Papers, Research
2 Comments

## The logic of Reverse Mathematics

This post is about a research idea I have been thinking about which is quite different from my usual research. It’s an example of a project with an “old fashioned” feel to it, as if it could have been studied … Continue reading