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