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