Ramsey theorems for product of finite sets with submeasures

DOI10.1007/S00493-011-2677-5zbMath1249.05379arXivmath/0212042OpenAlexW2172295723MaRDI QIDQ653997

Saharon Shelah, Jindřich Zapletal

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

creature forcingpolarized partitionRamsey theorems

Mathematics Subject Classification ID

Descriptive set theory (03E15) Ramsey theory (05D10) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (7)

Partition theorems from creatures and idempotent ultrafilters ⋮ Subadditive families of hypergraphs ⋮ Polarized partitions on the second level of the projective hierarchy ⋮ On embedding certain partial orders into the P-points under Rudin-Keisler and Tukey reducibility ⋮ A choice function on countable sets, from determinacy ⋮ CANONICAL MODELS FOR FRAGMENTS OF THE AXIOM OF CHOICE ⋮ On the Mikusiński-Antosik diagonal theorem and the equivalence of two types of convergence in Köthe spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Parametrized partitions of products of finite sets
• n–localization property
• Products of Infinitely Many Perfect Trees
• Large correlated families of positive random variables
• Norms on possibilities. I. Forcing with trees and creatures
• Partitions of products
• Borel sets and Ramsey's theorem
• Borel partitions of products of finite sets and the Ackermann function

This page was built for publication: Ramsey theorems for product of finite sets with submeasures