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)
type: Item
instance of: scholarly article
title: 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)
zbMATH Open document ID: 0631.03036
DOI: 10.1007/BF02776239
author: S. Shelah
author: Lee J. Stanley
published in: Israel Journal of Mathematics
publication date: 1986-01-01T00:00:00Z
review text: This paper is a continuation of the author's earlier S-Forcing I. A ``black-box'' theorem for morasses with applications to super-Souslin trees [Israel J. Math. 43, 185-224 (1982; Zbl 0513.03023)]. Notation and terminology from this previous work are carried over to the current one. \(S_{\kappa}(\diamond)\) is a strengthening of \(S_{\kappa}\), the previously presented forcing principle. The stated main result is: Theorem. For regular \(\kappa >\omega\), \(S_{\kappa}(\diamond)\) iff there exist (\(\kappa\),1)-morasses with built-in \(\diamond\) sequences. This leads to: in L for all regular \(\kappa >\omega\) there are (\(\kappa\),1) morasses with built-in \(\diamond\) sequences. This paper contains several applications of \(S_{\kappa}(\diamond)\). For example, \(S_{\aleph_ 1}(\diamond)\) implies the Magidor-Malitz language \({\mathcal L}[Q_ 1^{<\omega},Q^ 1_ 2]\) has the compactness, axiomatizability and transfer properties. Also for topological spaces \(S_{\aleph_ 1}(\diamond)\) implies there is a counterexample to Arhangel'skii's conjecture. This is a long and technically complex paper and it refers both positively and negatively (corrections to the earlier literature are made) to a large body of work.
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 03E40
Mathematics Subject Classification ID: 03E35
zbMATH DE Number: 4025431
zbMATH Keywords: morasses
zbMATH Keywords: Magidor-Malitz language
zbMATH Keywords: Arhangel'skii's conjecture
reviewed by: J. M. Plotkin
MaRDI profile type: Publication
cites work: Consistency proofs in model theory: A contribution to Jensenlehre
cites work: Q4156785
cites work: Aspects of constructibility
cites work: Hierarchies of constructible sets
cites work: The Souslin problem
cites work: Q3718702
cites work: Q3958454
cites work: Q3671958
cites work: Compact extensions of L(Q) (part 1a)
cites work: Lindelöf models of the reals: solution to a problem of Sikorski
cites work: Proper forcing
cites work: On some problems in general topology
cites work: S-forcing. I: a ''black-box'' theorem for morasses, with applications to super-Souslin trees
cites work: Q3323938
cites work: Trees, subtrees and order types
cites work: Morasses, diamond, and forcing
cites work: Q3221976
cites work: Simplified morasses with linear limits
cites work: 𝑃_{𝑘}𝜆 combinatorics. I. Stationary coding sets rationalize the club filter
Recommended article: Q3221976
Recommended article: Forcings constructed along morasses
Recommended article: More notions of forcing add a Souslin tree
Recommended article: A Forcing Axiom Deciding the Generalized Souslin Hypothesis
Recommended article: Q3422675
Recommended article: An variation for one souslin tree
Recommended article: Degrees of Souslin Trees
Recommended article: Almost Souslin Kurepa trees
Recommended article: Many countable support iterations of proper forcings preserve Souslin trees
Recommended article: Gap structure after forcing with a coherent Souslin tree
description: scientific article; zbMATH DE number 4025431