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