Connected components of graphs and reverse mathematics
From MaRDI portal
Publication:2277258
DOI10.1007/BF01269946zbMATH Open0725.03039MaRDI QIDQ2277258FDOQ2277258
Authors: Jeffry L. Hirst
Publication date: 1991
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Recommendations
subsystems of second-order arithmeticarithmetical comprehension schemedecompositions of graphs into connected componentsinduction schemeStatements about infinite graphs
Cites Work
- Subsystems of second order arithmetic
- Title not available (Why is that?)
- Degrees of models
- Countable algebra and set existence axioms
- Title not available (Why is that?)
- Ordinal numbers and the Hilbert basis theorem
- Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
- Effective Matchmaking and k-Chromatic Graphs
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Connected components of graphs and reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277258)