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)
From MaRDI portal
Publication:1094419
DOI10.1007/BF02776239zbMath0631.03036MaRDI QIDQ1094419
Saharon Shelah, Lee J. Stanley
Publication date: 1986
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (2)
A Forcing Axiom Deciding the Generalized Souslin Hypothesis ⋮ A theorem and some consistency results in partition calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lindelöf models of the reals: solution to a problem of Sikorski
- S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
- Proper forcing
- Aspects of constructibility
- The Souslin problem
- 𝑃_{𝑘}𝜆 combinatorics. I. Stationary coding sets rationalize the club filter
- Morasses, diamond, and forcing
- Simplified morasses with linear limits
- Trees, subtrees and order types
- Compact extensions of L(Q) (part 1a)
- Hierarchies of constructible sets
- Consistency proofs in model theory: A contribution to Jensenlehre
- On some problems in general topology
This page was built for publication: 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)
