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 similar from the point of view of their dependence relations.

### Boole’s Rings

- The classical and generalized Laver tables can be computed quickly. April 25, 2016 Joseph Van Name
- Reverse Mathematics of Matroids April 22, 2016 Carl Mummert
- The complexity of classification problems April 19, 2016 Samuel Coskey
- Generic Vopěnka’s Principle April 19, 2016 Victoria Gitman
- An example with Dedekind cuts April 19, 2016 Carl Mummert

### Comments on Boole’s Rings

- Comment on Every function can be computable! by Rahman. M April 23, 2016 Comments for Joel David Hamkins
- Comment on On the strength of second-order set theories beyond ZFC, PSC-CUNY Research Award grant, 2016 by Joel David Hamkins April 21, 2016 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Joel David Hamkins April 20, 2016 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Neil Barton April 20, 2016 Comments for Joel David Hamkins
- Comment on Kelley-Morse set theory implies Con(ZFC) and much more by Neil Barton April 20, 2016 Comments for Joel David Hamkins