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