Archives
Keywords
Uniformly coherent Strong coloring Square-Brackets Partition Relations 54G20 positive partition relation Postprocessing function Almost-disjoint family Absoluteness Partition Relations Whitehead Problem AIM forcing full tree Distributive tree Respecting tree stationary reflection Uniformization Successor of Singular Cardinal ZFC construction Precaliber Slim tree Club Guessing Martin's Axiom Chromatic number Foundations Hindman's Theorem Minimal Walks club_AD stick Cardinal Invariants Subtle tree property Closed coloring Coherent tree Open Access Sigma-Prikry Antichain PFA Reduced Power specializable Souslin tree Local Club Condensation. Greatly Mahlo Singular Density square principles Diamond for trees polarized partition relation incompactness Rock n' Roll Sakurai's Bell inequality Erdos Cardinal Subnormal ideal Generalized Clubs Small forcing Forcing tensor product graph O-space Fast club Iterated forcing Cardinal function transformations Ramsey theory over partitions indecomposable ultrafilter regressive Souslin tree Rainbow sets Ostaszewski square Mandelbrot set middle diamond Commutative projection system Filter reflection C-sequence countably metacompact P-Ideal Dichotomy Intersection model Almost countably chromatic Ascent Path Reflecting stationary set square Vanishing levels Fodor-type reflection strongly bounded groups Dowker space Knaster Large Cardinals approachability ideal Prevalent singular cardinals Constructible Universe GMA Diamond HOD coloring number diamond star reflection principles Aronszajn tree Poset Well-behaved magma Strongly Luzin set Fat stationary set unbounded function Dushnik-Miller weak Kurepa tree Ineffable cardinal Strongly compact cardinal Chang's conjecture SNR sap Prikry-type forcing Amenable C-sequence stationary hitting Cohen real Hereditarily Lindelöf space Jonsson cardinal projective Boolean algebra Rado's conjecture S-Space Lipschitz reduction Knaster and friends super-Souslin tree Universal Sequences Was Ulam right? Shelah's Strong Hypothesis xbox Non-saturation very good scale Hedetniemi's conjecture Souslin Tree Singular cofinality ccc Erdos-Hajnal graphs Parameterized proxy principle free Souslin tree Generalized descriptive set theory higher Baire space Nonspecial tree free Boolean algebra weak diamond Microscopic Approach Selective Ultrafilter weak square PFA(S)[S] Luzin set Diamond-sharp Ulam matrix Analytic sets Commutative cancellative semigroups Singular cardinals combinatorics Forcing Axioms Kurepa Hypothesis Subadditive nonmeager set b-scale Weakly compact cardinal Subtle cardinal Successor of Regular Cardinal Axiom R Uniformly homogeneous Almost Souslin Sierpinski's onto mapping principle OCA L-space Countryman line
Tag Archives: Vanishing levels
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
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. We investigate global structural properties of linear orders of a fixed infinite size. It is classical that the countable linear orders and the continuum-sized orders exhibit contrasting behaviours. Modern results show that strong extensions … 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
A guessing principle from a Souslin tree, with applications to topology
Joint work with Roy Shalev. Abstract. We introduce a new combinatorial principle which we call
Posted in Publications, Souslin Hypothesis, Topology
Tagged club_AD, Dowker space, O-space, regressive Souslin tree, S-Space, Souslin Tree, Vanishing levels
2 Comments
