Archives
Keywords
Diamond for trees Luzin set Absoluteness S-Space Successor of Singular Cardinal 54G20 HOD Fast club reflection principles tensor product graph Successor of Regular Cardinal Singular Density Cardinal function Erdos Cardinal Hedetniemi's conjecture ccc Lipschitz reduction Small forcing Forcing Axioms Open Access Chromatic number Cohen real weak Kurepa tree Foundations Square-Brackets Partition Relations Was Ulam right? Fat stationary set positive partition relation Partition Relations Forcing with side conditions projective Boolean algebra polarized partition relation free Souslin tree incompactness Intersection model Uniformly homogeneous free Boolean algebra weak square Vanishing levels Jonsson cardinal Constructible Universe P-Ideal Dichotomy Rock n' Roll Subadditive Rainbow sets Erdos-Hajnal graphs Singular cardinals combinatorics L-space Hereditarily Lindelöf space Monotonically far Countryman line Sakurai's Bell inequality O-space Greatly Mahlo coloring number b-scale Parameterized proxy principle Chang's conjecture Coherent tree Sigma-Prikry Reduced Power Club Guessing Interval topology on trees Strongly Luzin set Almost-disjoint family Prevalent singular cardinals middle diamond Prikry-type forcing Filter reflection Respecting tree Entangled linear order Local Club Condensation. Nonspecial tree weak diamond stationary reflection Subnormal ideal C-sequence Commutative projection system Minimal Walks Ostaszewski square Analytic sets OCA PFA higher Baire space full tree Strongly compact cardinal Ascent Path Universal Sequences Reflecting stationary set Non-saturation Slim tree Precaliber Strong coloring regressive Souslin tree Aronszajn tree Antichain club_AD very good scale Subtle cardinal Ascending path specializable Souslin tree Almost Souslin Iterated forcing Microscopic Approach Selective Ultrafilter Generalized descriptive set theory Cardinal Invariants Knaster ZFC construction Diamond Souslin Tree Rado's conjecture Postprocessing function diamond star Sierpinski's onto mapping principle super-Souslin tree indecomposable filter Almost countably chromatic Shelah's Strong Hypothesis Subtle tree property Dushnik-Miller countably metacompact Diamond-sharp sap unbounded function Singular cofinality Commutative cancellative semigroups SNR Dowker space Uniformly coherent Large Cardinals GMA approachability ideal Axiom R strongly bounded groups Uniformization Hindman's Theorem Fodor-type reflection Ulam matrix Ramsey theory over partitions Martin's Axiom Ineffable cardinal Kurepa Hypothesis Distributive tree square Well-behaved magma Generalized Clubs stationary hitting Knaster and friends Amenable C-sequence Forcing square principles transformations Whitehead Problem Poset stick Partition relations for trees xbox Mandelbrot set nonmeager set Weakly compact cardinal AIM forcing PFA(S)[S] Closed coloring perfectly normal
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 $\kappa$-Souslin tree with full vanishing levels. This answers a question from a previous paper, and provides an … Continue reading
Posted in Compactness, Publications
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Subtle tree property, Vanishing levels
2 Comments
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Answering a question of Ketonen from the late 1970’s, it is proved that a weakly compact cardinal carrying an indecomposable ultrafilter need not be measurable. The result is obtained by analyzing … Continue reading
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 $\kappa$-Souslin trees in a uniform way that does not … Continue reading
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 $V(\mathbf T)$ of a normal $\kappa$-tree $\mathbf T$. This is an invariant in the … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged Almost-disjoint family, Ascent Path, C-sequence, Coherent tree, Dowker space, Open Access, Parameterized proxy principle, regressive Souslin tree, Respecting tree, Subtle tree property, Uniformly homogeneous, Vanishing levels, weak Kurepa tree
2 Comments
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, Kurepa Hypothesis, Open Access, Subnormal ideal, Ulam matrix, Was Ulam right?
2 Comments
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 $\diamondsuit$-based constructions of Souslin trees with various additional properties may be rendered as applications of … Continue reading
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
