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