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