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