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