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