Archives
Keywords
Hedetniemi's conjecture Microscopic Approach xbox Diamond Chromatic number Greatly Mahlo Uniformization free Boolean algebra Strongly compact cardinal weak square Small forcing square Forcing Axioms Fodor-type reflection Absoluteness SNR Was Ulam right? strongly bounded groups C-sequence middle diamond approachability ideal Almost-disjoint family Luzin set Aronszajn tree HOD Diamond-sharp Generalized descriptive set theory square principles PFA Open Access Knaster and friends Subtle cardinal Subadditive Filter reflection Reflecting stationary set Antichain Well-behaved magma Erdos-Hajnal graphs Strongly Luzin set reflection principles Selective Ultrafilter Weakly compact cardinal Subnormal ideal specializable Souslin tree Chang's conjecture ZFC construction Minimal Walks incompactness Commutative projection system stationary reflection 54G20 Subtle tree property transformations Strong coloring Whitehead Problem OCA higher Baire space Sakurai's Bell inequality Partition Relations Countryman line Ostaszewski square Uniformly homogeneous Universal Sequences Ascent Path b-scale Hindman's Theorem Mandelbrot set Erdos Cardinal stick stationary hitting Commutative cancellative semigroups Precaliber Foundations Postprocessing function O-space Constructible Universe Almost Souslin Fat stationary set unbounded function Almost countably chromatic Successor of Regular Cardinal Nonspecial tree projective Boolean algebra Rado's conjecture weak Kurepa tree Singular Density Fast club Parameterized proxy principle Rock n' Roll P-Ideal Dichotomy Prikry-type forcing Hereditarily Lindelöf space PFA(S)[S] Vanishing levels Iterated forcing regressive Souslin tree S-Space positive partition relation Singular cardinals combinatorics Club Guessing Souslin Tree Non-saturation nonmeager set countably metacompact super-Souslin tree polarized partition relation AIM forcing weak diamond Large Cardinals full tree GMA free Souslin tree Diamond for trees sap Square-Brackets Partition Relations Dushnik-Miller Forcing Martin's Axiom Kurepa Hypothesis Sigma-Prikry indecomposable ultrafilter Knaster Prevalent singular cardinals Ulam matrix Ineffable cardinal diamond star ccc Successor of Singular Cardinal Generalized Clubs Local Club Condensation. Slim tree very good scale Respecting tree Distributive tree Coherent tree L-space Intersection model Cohen real Closed coloring Rainbow sets Amenable C-sequence Jonsson cardinal Uniformly coherent Poset Lipschitz reduction Axiom R Sierpinski's onto mapping principle coloring number Analytic sets Shelah's Strong Hypothesis club_AD Dowker space Cardinal function Cardinal Invariants Reduced Power Ramsey theory over partitions Singular cofinality tensor product graph
Tag Archives: Non-saturation
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
A relative of the approachability ideal, diamond and non-saturation
Abstract: Let
On guessing generalized clubs at the successors of regulars
Abstract: Konig, Larson and Yoshinobu initiated the study of principles for guessing generalized clubs, and introduced a construction of an higher Souslin tree from the strong guessing principle. Complementary to the author’s work on the validity of diamond and non-saturation … Continue reading
