Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees

DOI10.1016/0168-0072(87)90075-3zbMath0654.04002OpenAlexW2095026520MaRDI QIDQ1108269

Saharon Shelah, Matatyahu Rubin

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)90075-3

zbMATH Keywords

partition theorems\(\Delta\)-systemslarge free subtrees

Mathematics Subject Classification ID

Trees (05C05) Other combinatorial set theory (03E05)

Related Items

Cofinalities of elementary substructures of structures on \(\aleph_ \omega\) ⋮ Two applications of finite side conditions at \(\omega _2\) ⋮ MENAS’S CONJECTURE REVISITED ⋮ Splitting \({\mathcal P}_\kappa \lambda\) into maximally many stationary sets ⋮ A new Löwenheim-Skolem theorem ⋮ More on the revised GCH and the black box ⋮ Preserving old ([omega^{aleph_0},supseteq^*) is proper] ⋮ \(\mathrm{ZF}+\mathrm{DC}+\mathrm{AX}_4\) ⋮ Some applications of mixed support iterations ⋮ Shelah's pcf theory and its applications ⋮ Further cardinal arithmetic ⋮ A note on the Prabir Roy space ⋮ Non-saturation of the non-stationary ideal on P _κ (λ) with λ of countable cofinality ⋮ Thin stationary sets and disjoint club sequences ⋮ Constructions of many complicated uncountable structures and Boolean algebras

Cites Work

• Constructions of many complicated uncountable structures and Boolean algebras
• Iterated forcing and changing cofinalities
• Proper forcing
• Borel determinacy
• Proof of a conjecture of B. Ruziewicz
• On the expressibility hierarchy of Magidor-Malitz quantifiers
• An ideal game
• Intersection Theorems for Systems of Sets (II)
• Unnamed Item
• Unnamed Item
• Unnamed Item