Specialising Aronszajn trees by countable approximations

DOI10.1007/S00153-002-0168-5zbMath1037.03043arXivmath/0112287OpenAlexW2101150818MaRDI QIDQ1411659

Heike Mildenberger, Saharon Shelah

Publication date: 29 October 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

proper forcingcardinal characteristicscountable support iterations

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05) Cardinal characteristics of the continuum (03E17) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (4)

Random trees under CH ⋮ Many countable support iterations of proper forcings preserve Souslin trees ⋮ Creatures on ω₁ and weak diamonds ⋮ Specializing Aronszajn trees with strong axiom A and Halving

This page was built for publication: Specialising Aronszajn trees by countable approximations