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