Archives
Keywords
54G20 Whitehead Problem L-space Commutative projection system xbox Lipschitz reduction Jonsson cardinal Filter reflection SNR Uniformly homogeneous Minimal Walks Square-Brackets Partition Relations P-Ideal Dichotomy OCA perfectly normal Foundations higher Baire space coloring number Prevalent singular cardinals ZFC construction Intersection model Reflecting stationary set Erdos-Hajnal graphs Strongly Luzin set Ulam matrix ccc Cardinal function regressive Souslin tree Respecting tree approachability ideal PFA(S)[S] Fat stationary set Precaliber Sierpinski's onto mapping principle Strongly compact cardinal Cardinal Invariants Closed coloring Singular cofinality Forcing with side conditions free Boolean algebra Weakly compact cardinal polarized partition relation Microscopic Approach Cohen real projective Boolean algebra positive partition relation Ascent Path Singular Density Hindman's Theorem stick transformations weak diamond Kurepa Hypothesis Vanishing levels Fast club Sigma-Prikry Rainbow sets Large Cardinals free Souslin tree Small forcing Aronszajn tree Uniformization Diamond for trees Subtle tree property weak square Dushnik-Miller diamond star Constructible Universe square stationary hitting Universal Sequences Souslin Tree Entangled linear order square principles Axiom R Selective Ultrafilter Rado's conjecture weak Kurepa tree HOD Strong coloring very good scale strongly bounded groups Ramsey theory over partitions Commutative cancellative semigroups Club Guessing Chromatic number reflection principles Countryman line Knaster and friends Almost-disjoint family super-Souslin tree Partition relations for trees Successor of Regular Cardinal Martin's Axiom Iterated forcing club_AD Reduced Power Nonspecial tree Forcing PFA Subadditive Local Club Condensation. Uniformly coherent Chang's conjecture Knaster Prikry-type forcing Non-saturation Absoluteness Ascending path Generalized Clubs Singular cardinals combinatorics b-scale Interval topology on trees stationary reflection Hereditarily Lindelöf space Successor of Singular Cardinal tensor product graph specializable Souslin tree Amenable C-sequence Subtle cardinal C-sequence Luzin set incompactness indecomposable filter Well-behaved magma Postprocessing function sap countably metacompact Was Ulam right? Diamond-sharp Erdos Cardinal S-Space nonmeager set Coherent tree Almost countably chromatic Rock n' Roll Mandelbrot set Diamond Partition Relations Hedetniemi's conjecture Subnormal ideal Sakurai's Bell inequality O-space Fodor-type reflection Analytic sets Shelah's Strong Hypothesis Distributive tree GMA unbounded function Antichain Poset Ostaszewski square Monotonically far Open Access Dowker space Almost Souslin Greatly Mahlo Forcing Axioms Parameterized proxy principle Ineffable cardinal Generalized descriptive set theory full tree Slim tree middle diamond AIM forcing
Tag Archives: approachability ideal
The eightfold way
Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing … Continue reading
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
Shelah’s approachability ideal (part 2)
In a previous post, we defined Shelah’s approachability ideal $I[\lambda]$. We remind the reader that a subset $S\subseteq\lambda$ is in $I[\lambda]$ iff there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$ such that for club many $\delta\in S$, the union … Continue reading
Posted in Blog, Expository, Open Problems
Tagged approachability ideal, Club Guessing
Leave a comment
Shelah’s approachability ideal (part 1)
Given an infinite cardinal $\lambda$, Shelah defines an ideal $I[\lambda]$ as follows. Definition (Shelah, implicit in here). A set $S$ is in $I[\lambda]$ iff $S\subseteq\lambda$ and there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$, and some club $E\subseteq\lambda$, so … Continue reading
Jensen’s diamond principle and its relatives
This is chapter 6 in the book Set Theory and Its Applications (ISBN: 0821848127). Abstract: We survey some recent results on the validity of Jensen’s diamond principle at successor cardinals. We also discuss weakening of this principle such as club … Continue reading
The failure of diamond on a reflecting stationary set
Joint work with Moti Gitik. Abstract: It is shown that the failure of $\diamondsuit_S$, for a subset $S\subseteq\aleph_{\omega+1}$ that reflects stationarily often, is consistent with GCH and $\text{AP}_{\aleph_\omega}$, relatively to the existence of a supercompact cardinal. This should be comapred with … Continue reading
A relative of the approachability ideal, diamond and non-saturation
Abstract: Let $\lambda$ denote a singular cardinal. Zeman, improving a previous result of Shelah, proved that $\square^*_\lambda$ together with $2^\lambda=\lambda^+$ implies $\diamondsuit_S$ for every $S\subseteq\lambda^+$ that reflects stationarily often. In this paper, for a subset $S\subset\lambda^+$, a normal subideal of … Continue reading
