Connected components of graphs and reverse mathematics

DOI10.1007/BF01269946zbMath0725.03039MaRDI QIDQ2277258

Jeffry L. Hirst

Publication date: 1991

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

subsystems of second-order arithmeticarithmetical comprehension schemedecompositions of graphs into connected componentsinduction schemeStatements about infinite graphs

Mathematics Subject Classification ID

Connectivity (05C40) Second- and higher-order arithmetic and fragments (03F35)

Related Items

Reverse mathematics and Isbell's zig-zag theorem, On the existence of a connected component of a graph, Reverse Mathematics of Matroids

Cites Work

• Countable algebra and set existence axioms
• Degrees of models
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
• Ordinal numbers and the Hilbert basis theorem
• Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
• Effective Matchmaking and k-Chromatic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item