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