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