Archives
Keywords
Rainbow sets Erdos Cardinal Uniformly homogeneous diamond star Strongly compact cardinal Ascending path Square-Brackets Partition Relations HOD P-Ideal Dichotomy Forcing Axioms Interval topology on trees Ulam matrix perfectly normal free Boolean algebra Minimal Walks weak diamond positive partition relation Partition relations for trees Uniformly coherent Poset Almost Souslin Prevalent singular cardinals coloring number Mandelbrot set Respecting tree Precaliber Ineffable cardinal transformations nonmeager set Generalized Clubs Countryman line Commutative projection system free Souslin tree Successor of Regular Cardinal stationary reflection Sakurai's Bell inequality Strong coloring Subadditive Erdos-Hajnal graphs Shelah's Strong Hypothesis tensor product graph Diamond-sharp super-Souslin tree sap unbounded function L-space Absoluteness incompactness Coherent tree weak square Sierpinski's onto mapping principle projective Boolean algebra strongly bounded groups Hedetniemi's conjecture Non-saturation Open Access xbox PFA Universal Sequences Chromatic number Prikry-type forcing Nonspecial tree Forcing Ostaszewski square Generalized descriptive set theory S-Space Ascent Path Dushnik-Miller GMA b-scale stationary hitting Forcing with side conditions O-space Constructible Universe Singular cardinals combinatorics very good scale Uniformization Lipschitz reduction weak Kurepa tree Parameterized proxy principle indecomposable filter square Almost-disjoint family Fast club higher Baire space Whitehead Problem regressive Souslin tree Was Ulam right? Almost countably chromatic Reduced Power Monotonically far reflection principles Well-behaved magma Slim tree full tree Selective Ultrafilter Hereditarily Lindelöf space Rock n' Roll Postprocessing function Microscopic Approach Strongly Luzin set PFA(S)[S] Cardinal function Rado's conjecture Diamond for trees Local Club Condensation. Hindman's Theorem Luzin set Analytic sets Reflecting stationary set Successor of Singular Cardinal Club Guessing Large Cardinals Aronszajn tree Kurepa Hypothesis Subtle cardinal countably metacompact Closed coloring Iterated forcing Martin's Axiom OCA polarized partition relation Filter reflection Foundations approachability ideal Amenable C-sequence square principles SNR Partition Relations Greatly Mahlo ccc club_AD stick Cardinal Invariants Subtle tree property Weakly compact cardinal Knaster and friends Singular Density Singular cofinality Entangled linear order AIM forcing Sigma-Prikry Cohen real specializable Souslin tree Knaster Fodor-type reflection Commutative cancellative semigroups Souslin Tree Ramsey theory over partitions 54G20 Jonsson cardinal Diamond Chang's conjecture Antichain middle diamond Dowker space Vanishing levels Fat stationary set ZFC construction Intersection model Small forcing C-sequence Distributive tree Subnormal ideal Axiom R
Tag Archives: super-Souslin tree
More notions of forcing add a square
Joint work with Yair Hayut and Zhixing You. Abstract. Foreman and Magidor showed that the continuum hypothesis implies the existence of a countably-closed $\aleph_2$-cc forcing notion $\mathbb P$ for adding $\square_{\omega_1}$. Here, we show that $\mathbb P$ may consistently be … Continue reading
Posted in Squares and Diamonds
Tagged full tree, Souslin Tree, square principles, super-Souslin tree
Comments Off on More notions of forcing add a square
A forcing axiom deciding the generalized Souslin Hypothesis
Joint work with Chris Lambie-Hanson. Abstract. We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, … Continue reading
Posted in Publications, Souslin Hypothesis
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, Souslin Tree, square, super-Souslin tree
1 Comment
