Partial impredicativity in reverse mathematics
From MaRDI portal
Publication:5300073
DOI10.2178/jsl.7802070zbMath1275.03079arXiv1106.6063OpenAlexW2593536082MaRDI QIDQ5300073
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
ATRreverse mathematicstransfinite inductionMenger's theoremNash-Williams theoremproof-theoretic ordinalquasi-orderingimpredicativityHoward-Bachman ordinal
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)
Related Items
The computational strength of matchings in countable graphs, The Reverse Mathematics of wqos and bqos
Cites Work