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