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