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