Partial impredicativity in reverse mathematics

DOI10.2178/jsl.7802070zbMath1275.03079arXiv1106.6063OpenAlexW2593536082MaRDI QIDQ5300073

Henry Towsner

Publication date: 24 June 2013

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

ATRreverse mathematicstransfinite inductionMenger's theoremNash-Williams theoremproof-theoretic ordinalquasi-orderingimpredicativityHoward-Bachman ordinal

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (2)

The computational strength of matchings in countable graphs ⋮ The Reverse Mathematics of wqos and bqos

Cites Work

• Unnamed Item
• Menger's theorem in \(\Pi^1_1 \mathrm {-CA}_0\)
• An effective proof that open sets are Ramsey
• Proof-theoretic investigations on Kruskal's theorem
• On the strength of Ramsey's theorem for pairs
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen

This page was built for publication: Partial impredicativity in reverse mathematics