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