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