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