Reverse Mathematics of Matroids

DOI10.1007/978-3-319-50062-1_12zbMath1480.03007arXiv1604.04912OpenAlexW2964292697MaRDI QIDQ2970956

Jeffry L. Hirst, Carl Mummert

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04912

zbMATH Keywords

graphmatroidinductionreverse mathematicsconnected component

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (3)

Comparing representations for function spaces in computable analysis ⋮ Unnamed Item ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Closed choice and a uniform low basis theorem
• Independence in computable algebra
• Countable algebra and set existence axioms
• Addendum to ``Countable algebra and set existence axioms
• Recursion theory on fields and abstract dependence
• Connected components of graphs and reverse mathematics
• On uniform relationships between combinatorial problems
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• On the existence of a connected component of a graph
• Recursively enumerable vector spaces
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• On the Abstract Properties of Linear Dependence

This page was built for publication: Reverse Mathematics of Matroids