Archives
Keywords
Intersection model Fodor-type reflection Rock n' Roll Martin's Axiom Strongly compact cardinal Local Club Condensation. ccc Distributive tree b-scale Reduced Power Fast club Universal Sequences O-space indecomposable filter Vanishing levels Sakurai's Bell inequality Ramsey theory over partitions Erdos Cardinal Diamond-sharp Precaliber Singular cofinality Small forcing Foundations perfectly normal Knaster and friends Dowker space Ascending path specializable Souslin tree countably metacompact polarized partition relation weak square Respecting tree Reflecting stationary set Erdos-Hajnal graphs Club Guessing Diamond for trees Minimal Walks OCA Forcing with side conditions Nonspecial tree Rainbow sets Poset positive partition relation Absoluteness Hedetniemi's conjecture Subtle cardinal Fat stationary set Slim tree Prikry-type forcing Analytic sets Knaster Non-saturation Partition Relations incompactness Singular cardinals combinatorics Square-Brackets Partition Relations middle diamond Kurepa Hypothesis Hereditarily Lindelöf space stationary reflection Chang's conjecture PFA Jonsson cardinal free Souslin tree Ostaszewski square regressive Souslin tree unbounded function nonmeager set Shelah's Strong Hypothesis Singular Density Lipschitz reduction super-Souslin tree Countryman line Aronszajn tree Uniformly homogeneous Subtle tree property projective Boolean algebra Chromatic number Uniformly coherent Rado's conjecture Mandelbrot set club_AD Large Cardinals GMA Filter reflection Hindman's Theorem square principles Cardinal function Prevalent singular cardinals Almost Souslin P-Ideal Dichotomy ZFC construction xbox Closed coloring Forcing Axioms strongly bounded groups very good scale Coherent tree Microscopic Approach 54G20 transformations Successor of Regular Cardinal Sierpinski's onto mapping principle Uniformization Diamond Ineffable cardinal square Almost-disjoint family PFA(S)[S] Postprocessing function Entangled linear order C-sequence tensor product graph Well-behaved magma Strongly Luzin set Parameterized proxy principle Ulam matrix diamond star stick Cohen real SNR Greatly Mahlo Almost countably chromatic S-Space Constructible Universe Commutative cancellative semigroups Was Ulam right? Luzin set Generalized descriptive set theory Forcing Cardinal Invariants coloring number higher Baire space Whitehead Problem Successor of Singular Cardinal approachability ideal stationary hitting Commutative projection system weak Kurepa tree Partition relations for trees Souslin Tree weak diamond Axiom R HOD Open Access Monotonically far Weakly compact cardinal Subadditive Amenable C-sequence Interval topology on trees L-space Ascent Path Dushnik-Miller full tree Subnormal ideal sap Antichain reflection principles free Boolean algebra AIM forcing Strong coloring Selective Ultrafilter Iterated forcing Generalized Clubs Sigma-Prikry
Tag Archives: Amenable C-sequence
Winter School in Abstract Analysis, January 2023
I gave a 3-lecture tutorial at the Winter School in Abstract Analysis in Steken, January 2023. Title: Club guessing Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove … Continue reading
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if $\lambda$ is a singular strong-limit cardinal and $2^\lambda=\lambda^+$, then $\square^*_\lambda$ entails the existence of a $\lambda$-distributive $\lambda^+$-Aronszajn tree. Here, it is proved that the same conclusion remains … Continue reading
