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