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

DOI10.1090/conm/031/763904zbMath0536.03030OpenAlexW4247791169MaRDI QIDQ3320359

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

partition propertydirected setsupercompactclub filterstationary subset

Mathematics Subject Classification ID

Other combinatorial set theory (03E05)

Related Items (11)

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

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