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