Archives
Keywords
SNR weak Kurepa tree ccc reflection principles Generalized descriptive set theory incompactness Strong coloring Rock n' Roll Commutative projection system Postprocessing function Knaster Nonspecial tree Sierpinski's onto mapping principle Slim tree Coherent tree Chang's conjecture xbox Vanishing levels O-space GMA Selective Ultrafilter super-Souslin tree sap Iterated forcing Subtle cardinal Commutative cancellative semigroups HOD Parameterized proxy principle very good scale Large Cardinals weak square projective Boolean algebra Rado's conjecture Open Access Ascent Path middle diamond Entangled linear order Distributive tree higher Baire space L-space Foundations Reflecting stationary set full tree PFA Universal Sequences Uniformization countably metacompact Amenable C-sequence Uniformly homogeneous Ineffable cardinal Successor of Regular Cardinal Chromatic number Square-Brackets Partition Relations Filter reflection P-Ideal Dichotomy Cardinal Invariants Singular cofinality Club Guessing ZFC construction Ascending path Lipschitz reduction free Boolean algebra Was Ulam right? Constructible Universe Hereditarily Lindelöf space perfectly normal Reduced Power Poset S-Space positive partition relation Absoluteness Sigma-Prikry Rainbow sets Minimal Walks Almost Souslin Generalized Clubs Analytic sets Erdos Cardinal diamond star Subtle tree property stationary reflection Kurepa Hypothesis Successor of Singular Cardinal square Weakly compact cardinal Countryman line Shelah's Strong Hypothesis Greatly Mahlo Subnormal ideal specializable Souslin tree 54G20 nonmeager set tensor product graph Dowker space Hindman's Theorem Ramsey theory over partitions OCA Martin's Axiom Monotonically far Small forcing Precaliber Interval topology on trees Singular Density stationary hitting transformations Almost countably chromatic Strongly Luzin set Sakurai's Bell inequality Fodor-type reflection Fast club AIM forcing weak diamond Cardinal function Local Club Condensation. coloring number regressive Souslin tree polarized partition relation indecomposable filter Ulam matrix Almost-disjoint family Knaster and friends Diamond-sharp Erdos-Hajnal graphs b-scale Dushnik-Miller Aronszajn tree Ostaszewski square strongly bounded groups Intersection model Prikry-type forcing stick Fat stationary set Souslin Tree Closed coloring Mandelbrot set Whitehead Problem Respecting tree Diamond for trees Axiom R approachability ideal Singular cardinals combinatorics Partition Relations Strongly compact cardinal C-sequence club_AD Well-behaved magma Luzin set PFA(S)[S] Jonsson cardinal Uniformly coherent Forcing Axioms Antichain Non-saturation Cohen real Subadditive Prevalent singular cardinals Forcing square principles unbounded function Microscopic Approach free Souslin tree Hedetniemi's conjecture Forcing with side conditions Diamond
Tag Archives: 03E50
Jensen’s diamond principle and its relatives
This is chapter 6 in the book Set Theory and Its Applications (ISBN: 0821848127). Abstract: We survey some recent results on the validity of Jensen’s diamond principle at successor cardinals. We also discuss weakening of this principle such as club … Continue reading
