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