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

- Some thoughts about “automated theorem searching” June 26, 2016 Asaf Karagila
- choiceless grapher is now Linux installable June 22, 2016 Ioanna M. Dimitriou Henríquez
- Iterating Symmetric Extensions June 22, 2016 Asaf Karagila
- Syntactic T-Rex: Irregularized June 20, 2016 Asaf Karagila
- My very first lemma, which also happened to involve a philosophical dispute June 19, 2016 Joel David Hamkins

### Comments on Boole’s Rings

- Comment on Some thoughts about “automated theorem searching” by Peter June 27, 2016 Comments for Asaf Karagila
- Comment on Some thoughts about “automated theorem searching” by Asaf Karagila June 26, 2016 Comments for Asaf Karagila
- Comment on Math for eight-year-olds: graph theory for kids! by toysfab June 24, 2016 Comments for Joel David Hamkins
- Comment on Math for eight-year-olds: graph theory for kids! by La théorie des graphes pour enfants ! | Toysfab June 24, 2016 Comments for Joel David Hamkins
- Comment on My very first lemma, which also happened to involve a philosophical dispute by Pedro Sánchez Terraf June 23, 2016 Comments for Joel David Hamkins