Archives
Keywords
indecomposable ultrafilter PFA(S)[S] unbounded function Ramsey theory over partitions tensor product graph S-Space stick Parameterized proxy principle sap Commutative cancellative semigroups stationary hitting Generalized Clubs Rainbow sets Ulam matrix Closed coloring Cohen real incompactness Martin's Axiom Generalized descriptive set theory Foundations Knaster Filter reflection P-Ideal Dichotomy Constructible Universe Forcing Diamond 54G20 transformations PFA weak square Lipschitz reduction Sigma-Prikry Universal Sequences Diamond for trees Prevalent singular cardinals Reflecting stationary set Uniformization Souslin Tree Hindman's Theorem Large Cardinals Prikry-type forcing Analytic sets very good scale HOD Small forcing Almost-disjoint family Iterated forcing Selective Ultrafilter SNR Whitehead Problem ccc ZFC construction higher Baire space specializable Souslin tree Amenable C-sequence Greatly Mahlo Almost countably chromatic approachability ideal Hedetniemi's conjecture Kurepa Hypothesis Rock n' Roll Partition Relations Open Access Uniformly coherent Sakurai's Bell inequality projective Boolean algebra Successor of Regular Cardinal Sierpinski's onto mapping principle Was Ulam right Ascent Path Rado's conjecture Nonspecial tree Successor of Singular Cardinal Hereditarily Lindelöf space Poset C-sequence middle diamond Fat stationary set Almost Souslin stationary reflection Subnormal ideal coloring number Subtle tree property Cardinal function full tree GMA Singular cardinals combinatorics Fast club Weakly compact cardinal free Souslin tree Square-Brackets Partition Relations Minimal Walks square Antichain AIM forcing Absoluteness xbox positive partition relation Subtle cardinal Vanishing levels Club Guessing free Boolean algebra Forcing Axioms Strongly Luzin set Cardinal Invariants Distributive tree Slim tree Postprocessing function Strong coloring weak diamond Diamond-sharp polarized partition relation nonmeager set Chromatic number Erdos-Hajnal graphs OCA Well-behaved magma Non-saturation Dowker space diamond star strongly bounded groups Coherent tree Luzin set Local Club Condensation. square principles club_AD reflection principles Chang's conjecture Erdos Cardinal Precaliber Aronszajn tree L-space b-scale Jonsson cardinal Microscopic Approach Reduced Power Singular cofinality Subadditive Uniformly homogeneous Mandelbrot set countably metacompact O-space Knaster and friends regressive Souslin tree Axiom R Shelah's Strong Hypothesis Ostaszewski square super-Souslin tree Fodor-type reflection Dushnik-Miller Ineffable cardinal Singular Density
Tag Archives: Fodor-type reflection
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
Openly generated Boolean algebras and the Fodor-type reflection principle
Joint work with Sakaé Fuchino. Abstract: We prove that the Fodor-type Reflection Principle (FRP) is equivalent to the assertion that any Boolean algebra is openly generated if and only if it is $\aleph _2$-projective. Previously it was known that this … Continue reading