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