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