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