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