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