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