Archives
Keywords
Fat stationary set indecomposable ultrafilter 54G20 HOD Rock n' Roll Slim tree club_AD Luzin set Rado's conjecture Singular Density Vanishing levels Mandelbrot set full tree countably metacompact Greatly Mahlo Whitehead Problem Countryman line Weakly compact cardinal square principles Cardinal Invariants Ramsey theory over partitions weak Kurepa tree coloring number O-space free Boolean algebra Cohen real Ascent Path very good scale Filter reflection OCA Club Guessing Uniformly homogeneous approachability ideal PFA positive partition relation Ineffable cardinal weak square middle diamond Analytic sets Strong coloring stick regressive Souslin tree SNR Dushnik-Miller C-sequence Hindman's Theorem Subtle tree property Reflecting stationary set Strongly Luzin set Reduced Power Partition Relations reflection principles Fast club polarized partition relation Uniformization Iterated forcing Square-Brackets Partition Relations Respecting tree Jonsson cardinal stationary reflection Forcing Axioms Poset Postprocessing function Sakurai's Bell inequality Prikry-type forcing free Souslin tree Parameterized proxy principle weak diamond Rainbow sets Non-saturation Constructible Universe strongly bounded groups Commutative cancellative semigroups Antichain Selective Ultrafilter PFA(S)[S] Was Ulam right? diamond star P-Ideal Dichotomy Minimal Walks Open Access Coherent tree Subtle cardinal Foundations Universal Sequences AIM forcing Precaliber Nonspecial tree Hereditarily Lindelöf space Successor of Singular Cardinal stationary hitting L-space Generalized descriptive set theory Ostaszewski square square transformations Subnormal ideal Chromatic number Knaster Forcing Hedetniemi's conjecture Well-behaved magma xbox specializable Souslin tree Prevalent singular cardinals Almost countably chromatic Chang's conjecture Large Cardinals Singular cardinals combinatorics Shelah's Strong Hypothesis Martin's Axiom tensor product graph Successor of Regular Cardinal Amenable C-sequence Local Club Condensation. unbounded function Knaster and friends Closed coloring S-Space Diamond for trees Distributive tree Small forcing Commutative projection system projective Boolean algebra Singular cofinality ZFC construction Subadditive GMA Sigma-Prikry Almost Souslin Generalized Clubs Cardinal function Diamond Lipschitz reduction Strongly compact cardinal Axiom R sap ccc Sierpinski's onto mapping principle Souslin Tree Erdos Cardinal Absoluteness Erdos-Hajnal graphs nonmeager set Microscopic Approach Ulam matrix Uniformly coherent Dowker space Diamond-sharp higher Baire space Kurepa Hypothesis super-Souslin tree incompactness b-scale Aronszajn tree Almost-disjoint family Fodor-type reflection Intersection model
Tag Archives: C-sequence
A new model for all C-sequences are trivial
Joint work with Zhixing You and Jiachen Yuan. Abstract. We construct a model in which all C-sequences are trivial, yet there exists a
Posted in Compactness, Preprints
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Vanishing levels
Comments Off on A new model for all C-sequences are trivial
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Intersection models of generic extensions obtained from a commutative projection systems of notions of forcing has recently regained interest, especially in the study of descriptive set theory. Here, we show that … Continue reading
Posted in Compactness, Preprints
Tagged 03E05, 03E35, 03E55, Ascent Path, C-sequence, Commutative projection system, indecomposable ultrafilter, Intersection model, Strongly compact cardinal
Comments Off on Ketonen’s question and other cardinal sins
Proxy principles in combinatorial set theory
Joint work with Ari Meir Brodsky and Shira Yadai. Abstract. The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper as new foundations for the construction of
The vanishing levels of a tree
Joint work with Shira Yadai and Zhixing You. Abstract. We initiate the study of the spectrum of sets that can be realized as the vanishing levels
Was Ulam right? II: Small width and general ideals
Joint work with Tanmay Inamdar. Abstract. We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam’s theorem and its extension … Continue reading
Posted in Partition Relations, Publications
Tagged 03E02, 03E35, 03E55, C-sequence, Open Access, Subnormal ideal, Ulam matrix, Was Ulam right?
1 Comment
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
A microscopic approach to Souslin-tree constructions. Part II
Joint work with Ari Meir Brodsky. Abstract. In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known
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
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
