An effective proof that open sets are Ramsey

DOI10.1007/s001530050095zbMath0909.03040OpenAlexW1966953387MaRDI QIDQ1128188

Jeremy Avigad

Publication date: 25 March 1999

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

Full work available at URL: https://doi.org/10.1007/s001530050095

zbMATH Keywords

Ramsey partition\(ATR_0\)combinatorical principlesnonprincipal ultrafilter

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Second- and higher-order arithmetic and fragments (03F35)

Related Items (9)

Partial impredicativity in reverse mathematics ⋮ NON-PRINCIPAL ULTRAFILTERS, PROGRAM EXTRACTION AND HIGHER-ORDER REVERSE MATHEMATICS ⋮ CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC ⋮ Analytically heavy spaces: analytic Cantor and analytic Baire theorems ⋮ BASES AND BOREL SELECTORS FOR TALL FAMILIES ⋮ Hindman's theorem: an ultrafilter argument in second order arithmetic ⋮ \({\Pi^1_2}\)-comprehension and the property of Ramsey ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ Ultrafilters in reverse mathematics

This page was built for publication: An effective proof that open sets are Ramsey