Reverse Mathematics of Matroids

@inproceedings{Hirst2017ReverseMO,
  title={Reverse Mathematics of Matroids},
  author={Jeffry L. Hirst and Carl Mummert},
  booktitle={Computability and Complexity},
  year={2017}
}
  • Jeffry L. Hirst, Carl Mummert
  • Published in Computability and Complexity 2017
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    7 Citations

    Topics from this paper.

    Weihrauch Reducibility and Finite-Dimensional Subspaces
    Ramsey's theorem and products in the Weihrauch degrees
    • 6
    • PDF
    Comparing Representations for Function Spaces in Computable Analysis
    • 9
    • PDF
    Weihrauch Complexity in Computable Analysis
    • 33
    • PDF
    Combinatorial principles equivalent to weak induction
    • 2
    • PDF

    References

    SHOWING 1-10 OF 23 REFERENCES
    Connected components of graphs and reverse mathematics
    • 7
    Nowhere simplicity in matroids
    • 17
    • PDF
    On the existence of a connected component of a graph
    • 9
    • PDF
    Weihrauch degrees, omniscience principles and weak computability
    • 81
    • PDF
    Effective choice and boundedness principles in computable analysis
    • 108
    • PDF
    Closed choice and a Uniform Low Basis Theorem
    • 93
    • PDF
    Addendum to "countable algebra and set existence axioms"
    • 23
    • PDF