Reverse Mathematics of Matroids
Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of some basis theorems for matroids and enumerated matroids. Next, using Weihrauch reducibility, we relate the basis results to combinatorial choice principles and statements about vector spaces. Finally, we formalize some of the Weihrauch reductions to extract related reverse mathematics results. In particular, we show that the existence of bases for vector spaces of bounded dimension is equivalent to the induction scheme for \(\varSigma ^0_2\) formulas.
KeywordsReverse mathematics Matroid Induction Graph Connected component
MSC Subject Class (2000)03B30 03F35 05B35
- 2.Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles, weak computability. J. Symb. Log. 76(1), 143–176 (2011). doi:10.2178/jsl/1294170993. MR2791341 (2012c:03186)
- 6.Downey, R.: Abstract dependence and recursion theory and the lattice of recursively enumerable filters, Ph.D. thesis, Monash University, Victoria, Australia (1982)Google Scholar