𝑃_{𝑘}𝜆 combinatorics. I. Stationary coding sets rationalize the club filter

DOI10.1090/CONM/031/763904MaRDI QIDQ3320359zbMATH OpenOpenAlexFDO

Authors William S. Zwicker

Publication date 1984

Published in Axiomatic Set Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/conm/031/763904

zbMATH Keywords

club filterdirected setpartition propertystationary subsetsupercompact

Mathematics Subject Classification ID

Other combinatorial set theory (03E05)

Cited in

(12)

• 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)
• Semimorasses and nonreflection at singular cardinals
• On strong chains of uncountable functions
• Generating the club filter on \({\mathcal P}_{\kappa}\lambda\)
• Characterizations of the weakly compact ideal on \(P_\kappa\lambda\)
• When \(P_\kappa(\lambda)\) (vaguely) resembles \(\kappa\)
• On constructions with 2-cardinals
• Thin-very tall compact scattered spaces which are hereditarily separable
• P_κλ combinatorics II: The RK ordering beneath a supercompact measure
• Forcing minimal extensions of Boolean algebras
• A Forcing Axiom Deciding the Generalized Souslin Hypothesis
• The short extenders gap three forcing using a morass

This page was built for publication: 𝑃_{𝑘}𝜆 combinatorics. I. Stationary coding sets rationalize the club filter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320359)