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