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