Hindman's theorem: an ultrafilter argument in second order arithmetic

DOI10.2178/jsl/1294171005zbMath1214.03046arXiv0906.3882OpenAlexW2033215939MaRDI QIDQ3083144

Henry Towsner

Publication date: 18 March 2011

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

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

zbMATH Keywords

reverse mathematicsIPfull-matchhalf-matchHindmanultrafilter proof

Mathematics Subject Classification ID

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

Related Items (5)

NON-PRINCIPAL ULTRAFILTERS, PROGRAM EXTRACTION AND HIGHER-ORDER REVERSE MATHEMATICS ⋮ CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC ⋮ A simple proof and some difficult examples for Hindman's theorem ⋮ A combinatorial proof of the dense Hindman's theorem ⋮ Ultrafilters in reverse mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• An effective proof that open sets are Ramsey
• Algebra in the Stone-Čech compactification: theory and applications
• A short proof of Hindman's theorem
• Ultrafilters: Some old and some new results

This page was built for publication: Hindman's theorem: an ultrafilter argument in second order arithmetic