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