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