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