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