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