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