Archives
Keywords
Cardinal Invariants reflection principles approachability ideal tensor product graph specializable Souslin tree Non-saturation Dowker space Greatly Mahlo Square-Brackets Partition Relations Mandelbrot set Slim tree Open Access Club Guessing Erdos Cardinal Diamond-sharp strongly bounded groups Singular cofinality Large Cardinals sap Aronszajn tree indecomposable ultrafilter higher Baire space Strong coloring Weakly compact cardinal Subtle cardinal Ineffable cardinal Closed coloring countably metacompact Fodor-type reflection Martin's Axiom SNR Almost-disjoint family Chromatic number incompactness stationary hitting Sakurai's Bell inequality projective Boolean algebra S-Space Sigma-Prikry Antichain Iterated forcing Microscopic Approach Well-behaved magma free Boolean algebra Generalized Clubs Strongly Luzin set weak diamond Prikry-type forcing OCA very good scale Nonspecial tree Lipschitz reduction xbox Analytic sets Poset O-space club_AD Amenable C-sequence Was Ulam right Diamond Subnormal ideal Distributive tree Successor of Regular Cardinal Selective Ultrafilter Souslin Tree super-Souslin tree HOD regressive Souslin tree Subadditive Almost countably chromatic unbounded function Filter reflection stationary reflection weak square Fat stationary set Parameterized proxy principle Rainbow sets diamond star AIM forcing free Souslin tree Successor of Singular Cardinal Knaster transformations square principles Fast club Generalized descriptive set theory weak Kurepa tree Uniformly coherent Subtle tree property Rado's conjecture positive partition relation Singular Density Sierpinski's onto mapping principle Precaliber Small forcing Minimal Walks Diamond for trees Postprocessing function Ascent Path square Axiom R Rock n' Roll Reduced Power Uniformization C-sequence Partition Relations ZFC construction Hindman's Theorem Forcing Axioms Coherent tree GMA PFA(S)[S] Prevalent singular cardinals Reflecting stationary set Kurepa Hypothesis Hereditarily Lindelöf space Vanishing levels ccc Knaster and friends full tree Universal Sequences P-Ideal Dichotomy Luzin set PFA L-space Forcing b-scale Ostaszewski square Erdos-Hajnal graphs Hedetniemi's conjecture Local Club Condensation. Cardinal function Chang's conjecture Shelah's Strong Hypothesis Constructible Universe Cohen real Singular cardinals combinatorics Almost Souslin Absoluteness coloring number polarized partition relation Whitehead Problem nonmeager set stick Commutative cancellative semigroups Ulam matrix middle diamond Dushnik-Miller Jonsson cardinal Foundations Ramsey theory over partitions Uniformly homogeneous 54G20
Tag Archives: Forcing
Same Graph, Different Universe
Abstract. May the same graph admit two different chromatic numbers in two different universes? how about infinitely many different values? and can this be achieved without changing the cardinals structure? In this paper, it is proved that in Godel’s constructible … Continue reading
Posted in Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, approachability ideal, Chromatic number, Constructible Universe, Forcing, Ostaszewski square
10 Comments
INFTY Final Conference, March 2014
I gave an invited talk at the INFTY Final Conference meeting, Bonn, March 4-7, 2014. [Curiosity: Georg Cantor was born March 3, 1845] Title: Same Graph, Different Universe. Abstract: In a paper from 1998, answering a question of Hajnal, Soukup … Continue reading
Mathematics Colloquium, Bar-Ilan University, November 2013
I gave a colloquium talk at Bar-Ilan University on November 10, 2013. Title: Forcing as a tool to prove theorems Abstract: Paul Cohen celebrated solution to Hilbert’s first problem showed that the Continuum Hypothesis is independent of the usual axioms of … Continue reading
c.c.c. vs. the Knaster property
After my previous post on Mekler’s characterization of c.c.c. notions of forcing, Sam, Mike and myself discussed the value of it . We noticed that a prevalent verification of the c.c.c. goes like this: given an uncountable set of conditions, … Continue reading