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