Ramsey ultrafilters and countable-to-one uniformization

DOI10.1016/j.topol.2016.08.018zbMath1355.03037OpenAlexW2514887056MaRDI QIDQ330063

Richard Ketchersid, Jindřich Zapletal, Paul B. Larson

Publication date: 24 October 2016

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.topol.2016.08.018

zbMATH Keywords

forcinguniformizationRamsey ultrafilterinner modelscompletely Ramsey set

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (6)

Applying generic coding with help to uniformizations ⋮ Almost disjoint families under determinacy ⋮ An introduction to combinatorics of determinacy ⋮ Cardinality of wellordered disjoint unions of quotients of smooth equivalence relations ⋮ Ordinal definability and combinatorics of equivalence relations ⋮ CANONICAL MODELS FOR FRAGMENTS OF THE AXIOM OF CHOICE

Cites Work

• Perfect-set properties in \(L(\mathbb{R})[U\)]
• Souslin partitions of products of finite sets
• Introduction to Ramsey Spaces (AM-174)
• Some points in βN
• Happy families
• Semiselective coideals
• A dichotomy for the definable universe
• A choice function on countable sets, from determinacy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ramsey ultrafilters and countable-to-one uniformization