An effective proof that open sets are Ramsey

DOI10.1007/S001530050095MaRDI QIDQ1128188zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On partitioning the infinite subsets of large cardinals
• A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM
• Homogeneity for Open Partitions of Pairs of Reals
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′

Cited in

(14)

• Analytically heavy spaces: analytic Cantor and analytic Baire theorems
• On partitioning the infinite subsets of large cardinals
• Non-principal ultrafilters, program extraction and higher-order reverse mathematics
• Homogeneity for Open Partitions of Pairs of Reals
• Ultrafilters in reverse mathematics
• A GAME‐THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM
• THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE
• \({\Pi^1_2}\)-comprehension and the property of Ramsey
• Bases and Borel selectors for tall families
• Partial impredicativity in reverse mathematics
• A high dimensional Open Coloring Axiom
• The consistency strength of an infinitary Ramsey property
• Hindman's theorem: an ultrafilter argument in second order arithmetic
• Conservativity of ultrafilters over subsystems of second order arithmetic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128188)