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