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