Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)

DOI10.1007/s00153-012-0269-8zbMath1245.03018OpenAlexW1968578038MaRDI QIDQ412061

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

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) Infinite graphs (05C63)

Related Items (2)

Partial impredicativity in reverse mathematics ⋮ The computational strength of matchings in countable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Menger's theorem for infinite graphs
• Menger's theorem for countable graphs
• On the strength of König's duality theorem for infinite bipartite graphs
• Injective choice functions for countable families
• On the strength of König's duality theorem for countable bipartite graphs

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