A theorem and some consistency results in partition calculus
From MaRDI portal
Publication:579247
DOI10.1016/0168-0072(87)90015-7zbMath0625.03029OpenAlexW2002646945MaRDI QIDQ579247
Saharon Shelah, Lee J. Stanley
Publication date: 1987
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(87)90015-7
Related Items (9)
A set mapping with no infinite free subsets ⋮ Morasses, square and forcing axioms ⋮ Identities on cardinals less than ℵω ⋮ Coloring finite subsets of uncountable sets ⋮ ERDŐS AND SET THEORY ⋮ Filters, Cohen sets and consistent extensions of the Erdős-Dushnik-Miller Theorem ⋮ More consistency results in partition calculus ⋮ Forcings constructed along morasses ⋮ A consistency result concerning set mappings
Cites Work
- Unnamed Item
- Unnamed Item
- S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
- Combinatorial set theory: Partition relations for cardinals
- S-forcing. IIa: Adding diamonds and more applications: Coding sets, Arhangel'skii's problem and \({\mathcal L}[Q_ 1^{<\omega},Q^ 1_ 2\). (With an appendix by John P. Burgess)]
- Remarks on superatomic Boolean algebras
- Set theory. An introduction to independence proofs
- \(\aleph_\omega\) may have a strong partition relation
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- More consistency results in partition calculus
- Morasses, diamond, and forcing
- Simplified morasses
- Simplified morasses with linear limits
- A note on cardinal exponentiation
- Canonization theorems and applications
- An ideal game
- A Negative Partition Relation
This page was built for publication: A theorem and some consistency results in partition calculus
