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