Menger's theorem in ^1_1 -CA₀

DOI10.1007/S00153-012-0269-8MaRDI QIDQ412061zbMATH OpenOpenAlexFDO

Authors Paul Shafer

Publication date 3 May 2012

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

Full work available at URL https://doi.org/10.1007/s00153-012-0269-8

zbMATH Keywords

graph theoryreverse mathematicsmatching theory

Mathematics Subject Classification ID

Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Menger's theorem for infinite graphs
• Sur une extension du théorème de Menger aux graphes infinis. (On an extension of Menger's theorem to infinite graphs)
• Menger's Theorem for a Countable Source Set
• A formal approach to Menger's theorem
• Menger's theorem for countable graphs

Cites work

• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• Graph theory
• Injective choice functions for countable families
• Menger's theorem for countable graphs
• Menger's theorem for infinite graphs
• On the strength of König's duality theorem for countable bipartite graphs
• On the strength of König's duality theorem for infinite bipartite graphs
• Subsystems of second order arithmetic

Cited in

(4)

• On the existence of a connected component of a graph
• The computational strength of matchings in countable graphs
• An inside/outside Ramsey theorem and recursion theory
• Partial impredicativity in reverse mathematics

This page was built for publication: Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412061)