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