Archives
Keywords
xbox Hedetniemi's conjecture Respecting tree Singular cofinality Square-Brackets Partition Relations L-space Weakly compact cardinal OCA Subtle tree property Cardinal Invariants Small forcing Mandelbrot set Ostaszewski square Diamond for trees free Souslin tree strongly bounded groups Aronszajn tree Successor of Regular Cardinal Almost-disjoint family Dushnik-Miller Hindman's Theorem Erdos Cardinal Generalized descriptive set theory Chromatic number Nonspecial tree S-Space C-sequence Souslin Tree AIM forcing square principles unbounded function Subadditive Ineffable cardinal tensor product graph Foundations Well-behaved magma incompactness Jonsson cardinal Cardinal function ZFC construction nonmeager set Knaster and friends Constructible Universe Kurepa Hypothesis Minimal Walks ccc Generalized Clubs Analytic sets Strongly Luzin set Sigma-Prikry Diamond Parameterized proxy principle full tree Hereditarily Lindelöf space Greatly Mahlo square specializable Souslin tree Universal Sequences Precaliber Fodor-type reflection super-Souslin tree 54G20 weak Kurepa tree sap Intersection model P-Ideal Dichotomy Forcing Axioms Diamond-sharp Club Guessing very good scale stationary reflection Fat stationary set middle diamond indecomposable ultrafilter Open Access Antichain Iterated forcing stick b-scale Rainbow sets Selective Ultrafilter countably metacompact PFA(S)[S] GMA HOD transformations coloring number Almost Souslin Closed coloring Subnormal ideal higher Baire space Ascent Path weak diamond Postprocessing function weak square Slim tree PFA Large Cardinals Sierpinski's onto mapping principle Ramsey theory over partitions Whitehead Problem Amenable C-sequence Microscopic Approach Erdos-Hajnal graphs Partition Relations free Boolean algebra club_AD reflection principles approachability ideal Non-saturation Singular cardinals combinatorics projective Boolean algebra Absoluteness Reflecting stationary set regressive Souslin tree stationary hitting Commutative cancellative semigroups Prevalent singular cardinals Singular Density Strongly compact cardinal Strong coloring Commutative projection system Ulam matrix Was Ulam right Forcing Uniformly homogeneous Martin's Axiom positive partition relation O-space Uniformly coherent Shelah's Strong Hypothesis Successor of Singular Cardinal polarized partition relation Filter reflection Uniformization Fast club Sakurai's Bell inequality Local Club Condensation. Lipschitz reduction Distributive tree Rock n' Roll Poset Knaster Countryman line Cohen real Prikry-type forcing Coherent tree Dowker space Almost countably chromatic Subtle cardinal Chang's conjecture diamond star Luzin set Axiom R Rado's conjecture Reduced Power Vanishing levels SNR
Tag Archives: Souslin Tree
Young Researchers in Set Theory, March 2011
These are the slides of a talk I gave at the Young Researchers in Set Theory 2011 meeting (Königswinter, 21–25 March 2011). Talk Title: Around Jensen’s square principle Abstract: Jensen‘s square principle for a cardinal $\lambda$ asserts the existence of a particular ladder … 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
The Ostaszewski square, and homogeneous Souslin trees
Abstract: Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $\left\langle C_\alpha \mid \alpha<\lambda^+\right\rangle$ with the following remarkable guessing property: For every sequence $\langle A_i\mid i<\lambda\rangle$ … Continue reading
Posted in Publications, Souslin Hypothesis, Squares and Diamonds
Tagged 03E05, 03E35, Club Guessing, Fat stationary set, Ostaszewski square, Souslin Tree
5 Comments
