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