Coloring finite subsets of uncountable sets

DOI10.1090/S0002-9939-96-03450-8zbMath0865.03041arXivmath/9505216OpenAlexW1583142456MaRDI QIDQ3837583

Péter Komjáth, Saharon Shelah

Publication date: 10 December 1996

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

consistencyforcingGCHcombinatorial set theoryindependence proofs

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Cites Work

• Unnamed Item
• A theorem and some consistency results in partition calculus
• Remarks on superatomic Boolean algebras
• On uniformly antisymmetric functions
• A partition calculus in set theory
• A set mapping with no infinite free subsets
• Identities on cardinals less than ℵ_ω